#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;

typedef long long LL;

struct D{
	int i;
	LL k;
};

const int maxn=2e5+5;

int n,a[maxn],occur[maxn],d0;
LL k;
D p[maxn],d[maxn];
bool bz[maxn];

int ans0,ans[maxn];
void Last(int x)
{
	memset(bz,0,sizeof(bz));
	fo(i,x,n) if (!bz[a[i]])
	{
		ans[++ans0]=a[i];
		bz[a[i]]=1;
	} else
	{
		while (bz[a[i]]) bz[ans[ans0--]]=0;
	}
	fo(i,1,ans0) printf("%d ",ans[i]);
}

int main()
{
	scanf("%d %lld",&n,&k);
	fo(i,1,n) scanf("%d",&a[i]);
	
	fd(i,n,1)
	{
		if (occur[a[i]])
		{
			if (occur[a[i]]==n) p[i]=(D){1,1ll}; else p[i]=(D){occur[a[i]]+1,0ll};
		}
		occur[a[i]]=i;
	}
	memset(occur,0,sizeof(occur));
	fo(i,1,n)
	{
		if (!occur[a[i]]) occur[a[i]]=i;
		if (!p[i].i)
		{
			if (occur[a[i]]==n) p[i]=(D){1,2ll}; else p[i]=(D){occur[a[i]]+1,1ll};
		}
	}
	
	D i=(D){1,1};
	memset(occur,0,sizeof(occur));
	for(; i.k<k; i.k+=p[i.i].k, i.i=p[i.i].i)
	{
		d[++d0]=i;
		if (occur[i.i]) break; else occur[i.i]=d0;
	}
	
	if (i.k==k) {Last(i.i); return 0;}
	LL cir=d[d0].k-d[occur[d[d0].i]].k;
	i.k=d[occur[d[d0].i]].k+(k-d[occur[d[d0].i]].k)/cir*cir;
	
	for(; i.k<k; i.k+=p[i.i].k, i.i=p[i.i].i);
	Last(i.i);
}