B"This is the hard version of the problem. The difference is that in this version the array contains zeros. You can make hacks only if both versions of the problem are solved. You are given an array [a_1, a_2, ldots a_n] consisting of integers -1 , 0 and 1 . You have to build a partition of this array into the set of segments [l_1, r_1], [l_2, r_2], ldots, [l_k, r_k] with the following property: Note that each s_i does not have to be equal to zero, this property is about sum of s_i over all segments of partition. The set of segments [l_1, r_1], [l_2, r_2], ldots, [l_k, r_k] is called a partition of the array a of length n if 1 = l_1 <= r_1, l_2 <= r_2, ldots, l_k <= r_k = n and r_i + 1 = l_{i+1} for all i = 1, 2, ldots k-1 . In other words, each element of the array must belong to exactly one segment. You have to build a partition of the given array with properties described above or determine that such partition does not exist. Note that it is not required to minimize the number of segments in the partition. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10 ,000 ). Description of the test cases follows. The first line of each test case contains an integer n ( 1 <= n <= 200 ,000 ) -- the length of array a . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( a_i is -1 , 0 , or 1 ) -- the elements of the given array. It's guaranteed that the sum of n over all test cases does not exceed 200 ,000 . For each test case print an integer k -- the number of segments in the partition. If required partition does not exist, print -1 . If partition exists, in the i -th of the following k lines print two integers l_i and r_i -- description of the i -th segment. The following conditions should"...