DeleteFriends

#!/usr/bin/python

class TestCase:
    def __init__(self, N, delK, list_friends):
        if N < 1 or N > 100000:
            raise ValueError('no, {0}'.format(N))
        if K < 0 or K > N:
            raise ValueError('no, {0}'.format(K))
        for pop in list_friends:
            if pop < 0 or pop > 100:
                raise ValueError('no, {0}'.format(pop))
        self.N = N
        self.delK = delK
        self.list_friends = list_friends

    def algorithm(self):
        delFriend = False
        for i in range(0, len(self.list_friends)):
            if(self.list_friends[i] < self.list_friends[i+1]):
                del self.list_friends[i]
                delFriend = True
                break
        if delFriend == False:
            del self.list_friends[len(self.list_friends)-1]
        return self.list_friends

cases = long(raw_input())
for x in range(0, cases):
    vitals = raw_input()
    vitals = vitals.split()
    N, K = long(vitals[0]), long(vitals[1])
    pops = raw_input().split()
    pops = [long(pop) for pop in pops]
    tc = TestCase(N, K, pops)
    output = None
    for x in range(0, K):
        output = tc.algorithm()
    output_str = ""
    for x in output:
        output_str = output_str + str(x) + " "
    print(output_str)