#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n,k,sum,v,nxt[200005],i,dp[60][200005],j,a[200005],pq,pos;
const ll inf=1e18;
int main()
{
	scanf("%lld%lld",&n,&k);
	for(i=0;i<n;i++)scanf("%lld",&a[i]);
	for(i=0;i<n;i++)if(nxt[a[i]]==0)nxt[a[i]]=n+i;
	for(j=n-1;j>=0;j--)
	{
		dp[0][j]=nxt[a[j]]-j;
		nxt[a[j]]=j;	
	}	
	for(i=1;i<60;i++)
	{
		for(j=0;j<n;j++)
		{
			pq=dp[i-1][j]+1LL;
			pos=(j+pq)%n;
			pq+=dp[i-1][pos];
			if(pq>inf)dp[i][j]=inf;
			else dp[i][j]=pq;
		}
	}
	//printf("%lld\n",dp[1][0]);
	v=0;sum=n*k-1LL;
	if(sum==0)
	{
		printf("%lld\n",a[v]);
		return 0;
	}
	while(sum)
	{
		for(i=59;i>=0;i--)
		{
			if(dp[i][v]>sum)continue;
			sum-=dp[i][v];
			v=(v+dp[i][v])%n;
			if(sum==0)return 0;
			sum--;
			//printf("%lld %lld %lld\n",sum,v,dp[i][v]);
			v=(v+1LL)%n;
			if(sum==0)
			{
				printf("%lld ",a[v]);
				return 0;
			}
		}
		printf("%lld ",a[v]);
		sum--;
		v=(v+1)%n;
		if(sum==0)
		{
			printf("%lld ",a[v]);
			return 0;
		}
	}
	//printf("%lld ",a[v]);
	return 0;
} 