no tags

# Pick the Candies

Many children went to a sweet shop. There were n candy varieties and each variety is kept in a separate bowl. The sweetness of each variety is written on the bowl. All the children wanted the candy with highest sweetness value. As there are only limited candies in each variety, the shop keeper makes a rule. According to the rule, the shopkeeper will show selectively chosen k varieties to every children. The children can pick any one of those varieties and move away. To make it easy for him, the shop keeper shows the

varieties 1,2,...,k to children1,

varieties 2,3,…,k+1  to children2,

varieties 3,4,…,k+2 to children3 and so on..

All the children are good at math. Find what variety each child will choose.

Input Specification:
The first line contains an integer t, the number of test cases. For each test case the input consists of two lines. The first line contains two integers n(number of candy varieties) and k. The next line contains n number of integers, the sweetness values of all the candy varieties.

Output Specification:

For each test case, print the candy varieties chosen by the children.

Input Constraints:
1<=t<=1000
1<=n<=10000
1<=k<=n
0<=Sweetness value<=10000

Sample Input:

3
5 3
1 2 3 4 5
4 2
7 1 6 8
9 5
7 14 3 0 2 2 2 2 2

Sample Output:

3 4 5
7 6 8
14 14 3 2 2

Hint: use deque