B'Given an array a of n integers, find a range of values [x, y] ( x <= y ), and split a into exactly k ( 1 <= k <= n ) subarrays in such a way that: Print any solution that minimizes y - x . The input consists of multiple test cases. The first line contains a single integer t ( 1 <= q t <= q 3 cdot 10^4 ) -- the number of test cases. Description of the test cases follows. The first line of each test case contains two integers n and k ( 1 <= k <= n <= 2 cdot 10^5 ) -- the length of the array a and the number of subarrays required in the partition. The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= n ) where a_i is the i -th element of the array. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot10^5 . For each test case, print k+1 lines. In the first line, print x and y -- the limits of the found range. Then print k lines, the i -th should contain l_i and r_i ( 1 <= q l_i <= q r_i <= q n ) -- the limits of the i -th subarray. You can print the subarrays in any order. In the first test, there should be only one subarray, which must be equal to the whole array. There are 2 elements inside the range [1, 2] and 0 elements outside, if the chosen range is [1, 1] , there will be 1 element inside ( a_1 ) and 1 element outside ( a_2 ), and the answer will be invalid. In the second test, it is possible to choose the range [2, 2] , and split the array in subarrays (1, 3) and (4, 4) , in subarray (1, 3) there are 2 elements inside the range ( a_2 and a_3 ) and 1 element outside ( a_1 ), in subarray (4, 4) there is only 1 element ( a_4 ), and it is inside the range. In the third test, it is possible to choose the range [5, 5]$'...