Franklin is plotting a Christmas attack where he casts the spell Mass Hysteria on a village of elves. There are (n) elves numbered (1) to (n), where elf (i) has a health value of (h_i) and an attack value of (a_i). Initially, (h_i=a_i) for all (i), and all (a_i) are distinct. Elf (i) is alive if and only if its health is positive (i.e., (h_i>0)). When Franklin casts Mass Hysteria , the following process is repeated: Choose a pair of distinct living elves (x) and (y) ((h_x,h_y>0)) such that elf (x) has not attacked before. If no such pair exists, terminate the process. Then, elf (x) attacks elf (y), decreasing (h_y) by (a_x). Additionally, due to recoil, (h_x) is decreased by (a_y). Note that (a_x) and (a_y) remain unchanged. The process will repeat until it is impossible to choose a valid pair of elves. It can be shown that Mass Hysteria terminates after at most (n) iterations. Given an integer (m), construct a valid sequence of attacks such that exactly (m) elves are alive when the process ends; or determine that no such sequence exists. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains two integers (n) and (m) ((2\le n\le 2\cdot 10^5, 0\le m\le n)) — the number of elves in the village and the number of elves to be left alive. The second line contains (n) integers (a_1,a_2,\ldots,a_n) ((1\le a_i\le 10^9)) — the initial attack and health values of the elves. It is guaranteed that all (a_i) are distinct. It is guaranteed that the sum of (n) over all test cases does not exceed (2\cdot 10 ^ 5). For each test case, if it is impossible for exactly (m) elves to remain alive, print (-1). Otherwise, output a valid sequence of attacks as follows: On the first line,