After getting her PhD, Christie has become a celebrity at her university, and her facebook profile is full of friend requests. Being the nice girl she is, Christie has accepted all the requests.

Now Kuldeep is jealous of all the attention she is getting from other guys, so he asks her to delete some of the guys from her friend list. 

To avoid a 'scene', Christie decides to remove some friends from her friend list, since she knows the popularity of each of the friend she has, she uses the following algorithm to delete a friend.

Algorithm     
Delete(Friend):
    DeleteFriend=false
    for i = 1 to Friend.length-1
         if (Friend[i].popularity < Friend[i+1].popularity)
            delete i th friend
            DeleteFriend=true
            break
    if(DeleteFriend == false)
        delete the last friend

Input: 
First line contains T number of test cases.
First line of each test case contains N, the number of friends Christie currently has and K ,the number of friends Christie decides to delete.
Next  lines contains popularity of her friends separated by space.  

Output: 
For each test case print N-K numbers which represent popularity of Christie friend's after deleting K friends. 

Constraints
1 ≤ T ≤ 1000
1 ≤ N ≤ 100000
0 ≤ K< N 
0 ≤ popularity_of_friend ≤ 100  

NOTE:
Order of friends after deleting exactly K friends should be maintained as given in input.

SAMPLE INPUT
3
3 1
3 100 1
5 2
19 12 3 4 17
5 3
23 45 11 77 18

SAMPLE OUTPUT
100 1 
19 12 17 
77 18
for i in range(input()):
    N, K = [int(i) for i in raw_input().split()]
    P = [int(i) for i in raw_input().split()]
    stack = []
    count = 0
    for p in P:
    	while len(stack) > 0 and count < K and stack[-1] < p:
    		stack.pop()
    		count += 1
    	stack.append(p)
    if count < K:
    	stack = stack[0:K-count]
    print " ".join([str(i) for i in stack])