We have a sequence of N \times K integers: X=(X_0,X_1,\cdots,X_{N \times K-1}). Its elements are represented by another sequence of N integers: A=(A_0,A_1,\cdots,A_{N-1}). For each pair i, j (0 \leq i \leq K-1,\ 0 \leq j \leq N-1), X_{i \times N + j}=A_j holds.

Snuke has an integer sequence s, which is initially empty. For each i=0,1,2,\cdots,N \times K-1, in this order, he will perform the following operation:

* If s does not contain X_i: add X_i to the end of s.
* If s does contain X_i: repeatedly delete the element at the end of s until s no longer contains X_i. Note that, in this case, we do not add X_i to the end of s.



Find the elements of s after Snuke finished the operations.

Constraints

* 1 \leq N \leq 2 \times 10^5
* 1 \leq K \leq 10^{12}
* 1 \leq A_i \leq 2 \times 10^5
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N K
A_0 A_1 \cdots A_{N-1}


Output

Print the elements of s after Snuke finished the operations, in order from beginning to end, with spaces in between.

Examples

Input

3 2
1 2 3


Output

2 3


Input

5 10
1 2 3 2 3


Output

3


Input

6 1000000000000
1 1 2 2 3 3


Output




Input

11 97
3 1 4 1 5 9 2 6 5 3 5


Output

9 2 6
n,k=map(int,input().split())
a=list(map(int,input().split()))
aa=a+a
lp=[-1]*n
dn={}
for i in range(2*n):
    x=aa[i]
    if x in dn:
        dn[x].append(i)
    else:
        dn[x]=[i]
from bisect import bisect_right,bisect_left
now_idx=0
ka=set(())
cnt=1
while True:
    v=a[now_idx]
    tmp=bisect_right(dn[v],now_idx)
    next_idx=dn[v][tmp]
    if next_idx>=n:
        cnt+=1
        next_idx%=n
    if next_idx in ka:
        break
    ka.add(next_idx)
    lp[next_idx]=cnt
    now_idx=next_idx+1
    now_idx%=n
ml=max(lp)
k%=ml
ans=[]
#print(lp,k)
c=set(())
for i in range(n):
    if lp[-1-i]==-1 or lp[-1-i]%ml!=k:
        ans.append(str(a[-1-i]))
    else:
        break
ans.reverse()
dnn={}
m=len(ans)
for i in range(m):
    if ans[i] in dnn:
        dnn[ans[i]].append(i)
    else:
        dnn[ans[i]]=[i]
aans=[]
i=0
while i<m:
    tmp=bisect_right(dnn[ans[i]],i)
    if tmp==len(dnn[ans[i]]):
        aans.append(ans[i])
        i+=1
    else:
        i=dnn[ans[i]][tmp]+1
print(' '.join(aans))

