eolymp
bolt
Try our new interface for solving problems
Problems

Horse Racing

Horse Racing

Time limit 1 second
Memory limit 256 MiB

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 knight is assigned the value 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 data

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] denotes the strength of the knight in its normal state. The strength of the Karabakh horses doubles during the race.

Output data

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

Restrictions

  • 1t100

  • 1n10^5, sum of all n in all tests: ∑n ≤ 10^5

  • 0kn

  • 1a[i]10^9

Subtasks

This problem consists of 3 subtasks:

Subtask

Restrictions

Points

0

Example

0 points

1

k = 0

13 points

2

n1000, ∑n ≤ 1000

33 points

3

No additional restrictions

54 points

Examples

Input example #1
2
2 1
3 5
3 1
2 3 6
Output example #1
1 2
2 3
Author Rashad Mammadov
Source 2021 Azerbaijan, Republic Informatics Olympiad, Semifinal, March 8