#include<bits/stdc++.h>
using namespace std;

const int maxn=200003;
typedef long long ll;

int a[maxn],pos[maxn],nxt[maxn],val[maxn],fi[maxn];
int n;ll k;

int main(){
	scanf("%d%lld",&n,&k);
	for(int i=1;i<=n;++i)scanf("%d",&a[i]);
	if(n==1){
		if(k&1)printf("%d\n",a[1]);
		return 0;
	}
	for(int i=n;i>=1;--i)
		fi[a[i]]=i;
	for(int i=1;i<=n;++i){
		if(pos[a[i]])
			nxt[pos[a[i]]]=i%n+1;
		pos[a[i]]=i;
	}
	for(int i=1;i<=n;++i){
		if(!nxt[i]){
			if(fi[a[i]]==i)
				nxt[i]=i%n+1;
			else nxt[i]=fi[a[i]]+1;
		}
	}
	for(int i=1;i<=n;++i){
		if(nxt[i]>i+1)val[i]=nxt[i]-i;
		else val[i]=nxt[i]+n-i;
	}
	if(nxt[n]==1)val[n]=n+1;
	ll len=0;
	int cur=1;
	while(true){
		len+=val[cur];
		cur=nxt[cur];
		if(cur==1)break;
	}
	ll cir=len/n;
	k%=cir;
	if(!k)return 0;
	int id=1;cur=1;
	while(true){
		if(nxt[cur]>=cur+2){
			cur=nxt[cur];continue;
		}
		if(id==k){
			if(nxt[cur]==1&&cur!=n)return 0;
			printf("%d ",a[cur]);
			if(cur==n)return 0;
			++cur;
		}else{
			++id;
			cur=nxt[cur];
		}
	}
	return 0;
}

