#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<functional>
#include<map>
using namespace std;
int p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i,n) for(long long i=0;i<n;i++)
#define sor(v) sort(v.begin(),v.end())
#define mmax(a,b) a=max(a,b)
#define mmin(a,b) a=min(a,b)
#define mkp make_pair
#define pin pair<int,int>
#define qin pair<pin,int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define sq(a) (a)*(a)
#define rev(s) reverse(s.begin(),s.end())
#define end_pr(s) cout << s <<endl;return 0
#define itn int
#define bs bitset<5001>

int kai_size = 120001;
vel kai(kai_size, 1);
vel ink(kai_size, 1);
int RE() {
	vel v(3, 2);
	return v.at(4);
}
int ru(int a, int r) {
	if (r == 0) { return 1; }
	int ans = ru(a, r / 2);
	ans *= ans; ans %= p;
	if (r % 2 == 1) { ans *= a; }
	return ans % p;
}
int inv(int a) {
	return ru(a, p - 2);
}
void make_kai() {
	rep(i, kai_size - 1) { kai[i + 1] = (kai[i] * (i + 1)) % p; }
	rep(i, kai_size) { ink[i] = inv(kai[i]); }
}
int com(int n, int r) {
	int ans = kai[n] * ink[r];
	ans %= p; ans *= ink[n - r]; ans %= p;
	return ans;
}
vel dis(int mid1, vvel &way) {
	int n = way.size();
	vel dist(n, -1); dist[mid1] = 0;
	queue<int> q;
	q.push(mid1);
	while (!q.empty()) {
		int st = q.front(); q.pop();
		rep(i, way[st].size()) {
			int to = way[st][i];
			if (dist[to] == -1) {
				dist[to] = dist[st] + 1;
				q.push(to);
			}
		}
	}
	return dist;
}
pin most_far(int now, int n, vvel &way) {
	vel dist1 = dis(now, way);
	pin ans = mkp(-1, 0);
	rep(i, n) {
		if (dist1[i] > ans.first) { ans = mkp(dist1[i], i); }
	}
	return ans;
}

int per(int a, int b) {
	int ans = a % b;
	if (ans < 0) { ans += b; }
	return ans;
}
V<pin> uni(V<pin> &v) {
	sor(v);
	V<pin> ans(1, v[0]);
	for (int i = 1; i < v.size(); i++) {
		if (v[i] != v[i - 1]) { ans.push_back(v[i]); }
	}
	v = ans;
	return v;
}
int s_gcd(int a, int b) {
	if (b == 0) { return a; }
	return s_gcd(b, a%b);
}
int gcd(int a, int b) {
	if (a < b) { swap(a, b); }
	return s_gcd(a, b);
}
signed main() {
	int n, k; cin >> n >> k;
	vel a(n);
	int lim = 200001;
	vvel list(lim);
	rep(i, n) { cin >> a[i]; list[a[i]].push_back(i); }
	vel next(n);
	rep(i, lim) {
		int sz = list[i].size();
		for (int j = 0; j < sz; j++) {
			int ne_pla = j + 1;
			if (ne_pla == sz) { ne_pla = 0; }
			next[list[i][j]] = list[i][ne_pla];
		}
	}
	V<pin> way(n);
	rep(i, n) {
		int ni = next[i];
		int dis = per(ni - i, n);
		ni++; ni %= n;
		if (dis == 0) { dis += n; }
		dis++;
		way[i] = mkp(ni, dis);
	}
	int mod = 0;
	int now_pot = 0;
	int count = 0;
	while (true) {
		if (now_pot == 0) { count++; }
		if (count == 2) { break; }
		mod += way[now_pot].second;
		now_pot = way[now_pot].first;
	}
	int ex;
	if (count == 2) {
		ex= (n*k) % mod;
	}
	else {
		ex = n * k;
	}
	while (true) {
		int nex_dis = way[now_pot].second;
		if (ex < nex_dis) { break; }
		ex -= nex_dis;
		now_pot = way[now_pot].first;
	}
	stack<int> ans;
	vel counter(lim, 0);
	rep(i, ex) {
		int now_val = a[(now_pot + i) % n];
		if (counter[now_val] == 0) { ans.push(now_val); counter[now_val] = 1; }
		else {
			while (true) {
				int val = ans.top();
				counter[val]--;
				ans.pop();
				if (val == now_val) { break; }
			}
		}
	}
	int sz2 = ans.size();
	if (sz2 == 0) { return 0; }
	else {
		vel ret(sz2);
		rep(i, sz2) { ret[sz2 - i - 1] = ans.top(); ans.pop(); }
		rep(i, sz2-1) { cout << ret[i] << " "; }
		cout << ret[sz2 - 1] << Endl;
	}
	return 0;
}

Measured memory_bytes: 24888