#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;

int nxt[200005][65];
LL sts[200005][65];
LL k;
int n, A[200005];
int l_occ[200005];

int main()
{
	scanf("%d%lld", &n, &k);
	rep(i, n) scanf("%d", &A[i]);
	for(int i = n - 1; i >= 0; i --) l_occ[A[i]] = i;
	for(int i = n - 1; i >= 0; i --) {
		nxt[i][0] = l_occ[A[i]];
		sts[i][0] = l_occ[A[i]] <= i;
		l_occ[A[i]] = i;
	}
	
	rep(i, n) if(nxt[i][0] == n - 1) {
		nxt[i][0] = 0;
		sts[i][0] ++;
	} else nxt[i][0] ++;
	
	rep1(i, 60) rep(j, n) {
		nxt[j][i] = nxt[nxt[j][i - 1]][i - 1];
		sts[j][i] = sts[j][i - 1] + sts[nxt[j][i - 1]][i - 1];
	}
	
	int cur = 0;
	for(int i = 60; i >= 0; i --) if(sts[cur][i] < k) {
		k -= sts[cur][i];
		cur = nxt[cur][i];
	}
	
	for(int i = cur; i < n; i ++)
	if(sts[i][0] == (nxt[i][0] == 0)) {
		if(nxt[i][0] == 0) break;
		i = nxt[i][0] - 1;
	} else printf("%d ", A[i]);
	return 0;
}