David is going to organize a quiz game in his restaurant. David has N problems, and he will choose K problems for the quiz game. Every participant has to answer all K problems.
David thinks that if a participant solves all K problems correctly, the participant will get bored, and if a participant solves less problems correctly, the participant will feel sad. Therefore, David decides to choose K problems maximizing the probability that participants will solve exactly K-1 problems correctly.
The N problems are numbered from 1 to N. David assumes, the problem i will be solved correctly with probability Pi% for each i, and these are statistically independent of each other.
Can you tell what problems are chosen by David?
INPUT
The first line contains an integer T, the number of test cases. Then T test cases follow. The first line for each test case has 2 integers N and K. The next line has N integers P1, P2, ..., PN.
OUTPUT
For each test case, print K distinct integers denoting the numbers of chosen problems. If there are multiple sets of problems maximizing the probability, then anyone will do.
CONSTRAINTS
1 ≤ T ≤ 20 1 ≤ K ≤ N ≤ 36 0 ≤ Pi ≤ 100