#include <iostream>
#include <vector>
#include <set>

using namespace std;

typedef long long ll;

int n;
ll k;
int a[202020];
int f[202020];
int d[202020];

int main() {
	cin >> n >> k;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = n; i >= 1; i--) {
		f[i] = d[a[i]];
		d[a[i]] = i;
	}
	int p = 1;
	int c = 1;
	while (true) {
		if (f[p] != 0) {
			p = f[p];
		} else {
			p = d[a[p]];
			c++;
		}
		if (p == n) break;
		p++;
	}
	k %= c;
	p = 1;
	c = 1;
	while (c < k) {
		if (f[p] != 0) {
			p = f[p];
		} else {
			p = d[a[p]];
			c++;
		}
		p++;
	}
	vector<int> u;
	set<int> s;
	for (int i = p; i <= n; i++) {
		if (s.count(a[i])) {
			while (s.count(a[i])) {
				s.erase(u.back());
				u.pop_back();
			}
		} else {
			u.push_back(a[i]);
			s.insert(a[i]);
		}
	}
	for (auto x : u) cout << x << " ";
	cout << "\n";
}
