Horse Racing#10453

Horse Racing

1 second

256 megabytes

Easy

Finally, that long-awaited day has come, and you can again watch horse races on the Jydyr plain.

$n$ horses will participate in the races. Each horse is assigned the value $a_{i}$ a_i - the horse's strength. Among them there are $k$ horses of the Karabakh breed. Karabakh horses have one peculiarity. During the arrival, their strength is doubled. But you do not know which horses belong to this breed, that is, each of the horses has a chance to be Karabakh, but there are only $k$ of them.

The strongest horse wins the race. Identify the horses that are most likely to win.

Note: if there are several strongest horses in a race, then everyone has a chance to win.

Input

The first line contains one integer $t$ - the number of test cases.

Then, in each of the following $t$ tests, the first line contains two numbers $n$ and $k$ , and the second line contains $n$ integers $a_{i}$ a_i.

$a_{i}$ a_i denotes the strength of the horse in its normal state. The strength of the Karabakh horses doubles during the race.

Constraints:

$1 \leq t \leq 100$ 1 \le t \le 100
$1 \leq n \leq 1 0^{5}$ 1 \le n \le 10^5, sum of all $n$ in all tests: $\sum n \leq 1 0^{5}$ \sum n \le 10^5
$0 \leq k \leq n$ 0 \le k \le n
$1 \leq a_{i} \leq 1 0^{9}$ 1 \le a_i \le 10^9

Output

Print in ascending order the numbers of the horses that have the probability to win.

Scoring

This problem consists of 3 subtasks:

Subtask	Restrictions	Points
0	Example	0 points
1	$k = 0$ k = 0	13 points
2	$n \leq 1000$ n \le 1000, $\sum n \leq 1000$ \sum n \le 1000	33 points
3	No additional restrictions	54 points

Examples

Example 1