#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#ifdef rd
#define trace(...) cout<<"Line:"<<__LINE__<<" "; __f(#__VA_ARGS__, __VA_ARGS__)
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
	cout<<name<<" : "<<arg1<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
	const char *comma=strchr(names+1,',');
	cout.write(names,comma-names)<<" : "<<arg1<<" | ";
	__f(comma+1,args...);
}
#else
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef float f80;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sz(x) ((long long)x.size())
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c) for(int a=b; a<c; a++)
#define trav(a,x) for(auto &a:x)
#define all(con) con.begin(),con.end()
const ll infl=0x3f3f3f3f3f3f3f3fLL;
const int infi=0x3f3f3f3f;
const int mod=998244353;
//const int mod=1000000007;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
auto clk=clock();
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
	uniform_int_distribution<int> uid(0,lim-1);
	return uid(rang);
}
int powm(int a, int b) {
	int res=1;
	while(b) {
		if(b&1)
			res=(res*a)%mod;
		a=(a*a)%mod;
		b>>=1;
	}
	return res;
}


int a[400005],nex[60][400005],last[200005],disp[60][400005];
int occur[200005];
void solve() {
	int n,k;
	cin>>n>>k;
	fr(i,1,n) {
		cin>>a[i];
		a[n+i]=a[i];
	}
	for(int i=2*n; i>0; i--) {
		nex[0][i]=last[a[i]]%n+1;
		disp[0][i]=last[a[i]]+1-i;
		last[a[i]]=i;
	}
	for(int j=1; j<60; j++) {
		for(int i=1; i<=n; i++) {
			nex[j][i]=nex[j-1][nex[j-1][i]];
			disp[j][i]=disp[j-1][i]+disp[j-1][nex[j-1][i]];
			if(disp[j][i]>1e18) {
				disp[j][i]=1e18;
			}
		}
	}
//	for(int i=1; i<=n; i++) {
//		cout<<disp[0][i]<<" ";
//	}
//	cout<<endl;
//	for(int i=1; i<=n; i++) {
//		cout<<nex[0][i]<<" ";
//	}
//	cout<<endl;
	int at=1,howmany=n*k;
//	trace(howmany);
	for(int i=59; i>=0; i--) {
		if(disp[i][at]<=howmany) {
			howmany-=disp[i][at];
			at=nex[i][at];
//			trace(howmany);
		}
	}
	vi ans;
//	trace(at);
	for(; at<=n; at++) {
//		trace(occur[a[at]],n);
		if(occur[a[at]]==1) {
			occur[a[at]]=0;
			while(ans.back()!=a[at]) {
				occur[ans.back()]=0;
				ans.pop_back();
			}
			ans.pop_back();
		} else {
			occur[a[at]]=1;
			ans.pb(a[at]);
		}
	}
//	cout<<sz(ans)<<endl;
	for(int i:ans)
		cout<<i<<" ";
}

signed main() {
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	srand(chrono::high_resolution_clock::now().time_since_epoch().count());
	cout<<fixed<<setprecision(10);
	int t=1;
//	cin>>t;
	fr(i,1,t)
	{
		solve();
	}
#ifdef rd
	cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
#endif
	return 0;
}


Measured memory_bytes: 384496