Chef has an array of N natural numbers most of them are repeated. Cheffina challenges chef to find all numbers(in ascending order) whose frequency is strictly more than K.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow. 
- Each test case contains two lines of input, two integers $N, K$.
- N space-separated natural numbers.
-----Output:-----
For each test case, output in a single line answer.
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N, K \leq 10^5$
- $1 \leq arr[i] \leq 10^5$
-----Sample Input:-----
1
5 1
5 2 1 2 5
-----Sample Output:-----
2 5
from sys import*
input=stdin.readline
t=int(input())
for _ in range(t):
    n,k=map(int,input().split())
    l=[int(x) for x in input().split()]
    mp={}
    for items in l:
        try:
            mp[items]+=1
        except:
            mp[items]=1
    l=list(set(l))
    l.sort()
    for items in l:
        if mp[items]>k:
            print(items,end=" ")
    print() 
  
from sys import*
input=stdin.readline
t=int(input())
for _ in range(t):
    n,k=map(int,input().split())
    l=[int(x) for x in input().split()]
    mp={}
    for items in l:
        try:
            mp[items]+=1
        except:
            mp[items]=1
    l=list(set(l))
    l.sort()
    for items in l:
        if mp[items]>k:
            print(items,end=" ")
    print() 
  