Shubham Vishwakarma Sir, the best coder ever of NIT Jamshedpur was one of the finest gem of this country. His vision was to make the best coding environment in our institution among all good institutions of this country. So, he was very helpful for all the juniors.
Almost all the juniors used to visit shubham sir regularly to clear their doubts. As there there were many juniors, he always wanted to give equal opportunity to all the juniors. So, he asked all the juniors to maintain a queue where ith junior is having doubt in ai questions. If a junior is having problem in more than one question, he send him to back of the queue after clearing the doubts of one question, i.e, he clears the doubt of only one question at a time to a junior and send them back at the end of the queue.

One day there are N number of juniors, where ith junior is having doubt in ai questions. And since shubham sir is very busy, he wanted to clear the doubts of K number of questions. Your task is to find the structure of the queue after k number of questions, i.e., the student number of each students standing in queue.

For clarity you can see the explanation.

Input:
The first contains T, the number of test cases.

The first line of each test case contains two space-separated integers N and K. In the second line are given space-separated integers a1, a2,...,an, the number of questions in which each student is having doubt.

Output:
If he clears less than k problems, print a single number "-1" (without quotes). Otherwise, print the sequence of numbers - number of student in the order in which they stand in the queue.

Note that this sequence may be empty. You can just print nothing in this case.

Constraints:
1 <= T <= 100
1 <= N <= 10^5
1 <= K <= 10^14
1 <= ai <= 10^9

Problem Setter:

Akash Rakshit