B'The only difference between the two versions of this problem is the constraint on the maximum number of operations. You can make hacks only if all versions of the problem are solved. You are given an array a_1, a_2, ... , a_n of integers (positive, negative or 0 ). You can perform multiple operations on the array (possibly 0 operations). In one operation, you choose i, j ( 1 <= q i, j <= q n , they can be equal) and set a_i := a_i + a_j (i.e., add a_j to a_i ). Make the array non-decreasing (i.e., a_i <= q a_{i+1} for 1 <= q i <= q n-1 ) in at most 31 operations. You do not need to minimize the number of operations. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 500 ). The description of the test cases follows. The first line contains a single integer n ( 1 <= n <= 20 ) -- the length of the array. The second line contains n integers a_1, a_2, ldots, a_n ( -20 <= a_i <= 20 ) -- the array before performing the operations. For each test case, output your operations in the following format. The first line should contain an integer k ( 0 <= k <= 31 ) -- the number of operations. The next k lines represent the k operations in order. Each of these k lines should contain two integers i and j ( 1 <= q i, j <= q n ) -- the corresponding operation consists in adding a_j to a_i . After all the operations, the array a_1, a_2, ... , a_n must be non-decreasing. In the first test case, by adding a_1 = 2 to a_2 , we get the array [2, 3] which is non-decreasing. In the second test case, the array changes as: In the third test case, the final array is [2, 3, 3, 3, 3] . '...