#include <bits/stdc++.h>
#define ll long long
#define xx first
#define yy second
using namespace std;
const int N = 200000 + 5;
int h[N], suf[N], info[N], n;
int stk[N], top;
ll k;
bool vis[N];

int main () {
	#ifdef wll
	freopen ("testdata.in", "r", stdin);
	#endif
	scanf ("%d%lld", &n, &k);
	for (int i = 1; i <= n; ++i) {scanf ("%d", &info[i]);}
	for (int i = 1; i <= n; ++i) {if (h[info[i]]) {suf[h[info[i]]] = i;}h[info[i]] = i;}
	for (int i = n; i >= 1; --i) {h[info[i]] = i;}
	for (int i = 1; i <= n; ++i) {if (!suf[i]) {suf[i] = h[info[i]];}}
	int cir = 1, now = 1;
	while (1) {
		bool flag = false;
		if (suf[now] <= now) {cir++;flag = true;}
		now = suf[now] % n + 1;
		if (vis[now]) {if (flag)--cir;break;}
		vis[now] = 1;
	}
	k %= cir;
	now = 1;
	int cnt = 1;
	while (1) {
//		printf ("%d %d\n", now, cnt);
		if (now > n) {now -= n;cnt++;}
		if (now > n || cnt > k) {break;}
		int nxt = suf[now];
		if (nxt <= now) {
			if (1LL * cnt >= k) {stk[++top] = info[now++];continue;}
			else {cnt++; now = suf[now] + 1;}
		}
		else {
			now = suf[now] + 1;
		}
	}
	for (int i = 1; i <= top; ++i) {
		printf ("%d ", stk[i]);
	}
	return 0;
}









