//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include <ctime>
#include<list>
#include <numeric>
#include<bitset>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<stack>
#include<assert.h>
#include<unordered_map>
#include<unordered_set>
#include <array>
using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
	~debug() { cerr << endl; }
	template<class c> typename enable_if<sizeof dud<c>(0) != 1, debug&>::type operator<<(c i) {
		cerr << boolalpha << i; return *this;
	}

	template<class c, int=0> typename enable_if<sizeof dud<c>(0) == 1, debug&>::type operator<<(c i) {
		return *this << range(begin(i), end(i));
	}

sim, class b dor(pair < b, c > d) {
	ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
	*this << "[";
	for (auto it = d.b; it != d.e; ++it)
		*this << ", " + 2 * (it == d.b) << *it;
	ris << "]";
}
#else
	sim dor(const c&) { ris; }
#endif
};
#define watch(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ( (X) > 0 ? (X) : ( -(X) ) )
#define S(X) ( (X) * (X) )
#define SZ(V) (int )V.size()
#define FORN(i, n) for(int i = 0; i < n; i++)
#define FORAB(i, a, b) for(int i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C)  ((B) <= (A) && (A) <= (C))
#define AIN(A, B, C) assert(IN(A, B, C))

//typedef int LL;
typedef long long int LL;
//typedef __int128 LLL;
typedef long long LLL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PLL > VPL;
typedef vector<PII > VP;
typedef vector<double> VD;
typedef vector<vector<int>> VVI;
typedef long double ld;

const LL MOD = 998244353;

int n;
LL k;
int num[200005];
map<int, int> First, Next;
PII nxt[200005];
int come[2][200005];

void solve(int ks) {
	scanf("%d %lld", &n, &k);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &num[i]);
		if (First.find(num[i]) == First.end()) First[num[i]] = i;
	}
	if (n == 1) {
		if (k % 2) printf("%d ", num[1]);
		return;
	}
	for (int i = n; i >= 1; i--) {
		int pos = -1;
		if (Next.find(num[i]) != Next.end()) {
			pos = Next[num[i]];
		}
		else {
			pos = First[num[i]];
		}

		if (pos > i) {
			if (pos + 1 <= n) nxt[i] = { pos + 1, 0 };
			else if (pos == n) nxt[i] = { 1, 1 };
			else assert(0);
		}
		else {
			if (pos == n) nxt[i] = { 1, 2 };
			else nxt[i] = { First[num[i]] + 1, 1 };
		}
		Next[num[i]] = i;
	}

	MEM(come, -1);
	int now = 1, pos = 1;
	while (true) {
		if (come[0][pos] == -1) {
			come[0][pos] = now;
		}
		else if (come[1][pos] == -1) {
			come[1][pos] = now;
		}
		else break;
		now += nxt[pos].second;
		pos = nxt[pos].first;
	}

	int whr = -1;
	for (int i = n; i >= 1; i--) {
		if (come[0][i] == k) whr = i;
		if (come[1][i] == k) whr = i;
		if (come[1][i] != -1) {
			LL a = come[0][i];
			LL b = come[1][i];
			if (k >= b && (k - a) % (b - a) == 0) whr = i;
		}
	}
	int flag = 0;
	if (whr == -1) {
		for (int i = n; i >= 1; i--) {
			if (come[0][i] == k - 1) whr = i;
			if (come[1][i] == k - 1) whr = i;
			if (come[1][i] != -1) {
				LL a = come[0][i];
				LL b = come[1][i];
				if (k - 1 >= b && (k - 1 - a) % (b - a) == 0) whr = i;
			}
		}
		flag = 1;
	}
	assert(whr != -1);
	map<int, int> M;
	VI ans;
	for (int i = whr; i <= n; i++) {
		if (M[num[i]]) {
			while (ans.back() != num[i]) {
				M[ans.back()]--;
				ans.pop_back();
			}
			M[ans.back()]--;
			ans.pop_back();
			continue;
		}
		ans.push_back(num[i]);
		M[num[i]]++;
	}
	if (flag) {
		for (int i = 1; i <= n; i++) {
			if (M[num[i]]) {
				while (ans.back() != num[i]) {
					M[ans.back()]--;
					ans.pop_back();
				}
				M[ans.back()]--;
				ans.pop_back();
				continue;
			}
			ans.push_back(num[i]);
			M[num[i]]++;
		}
	}
	for (int x : ans) printf("%d ", x);


}

int main()
{
#ifdef LOCAL
	double start_time = clock();
	freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
	//	freopen("out.out", "w", stdout);
#endif


	if (0) {
		int T;
		scanf("%d", &T);
		//AIN(T, 1, 25);
		for (int ks = 1; ks <= T; ks++) {
			solve(ks);
			fprintf(stderr, "%d done\n", ks);
		}
	}
	else {
		solve(0);
	}

#ifdef LOCAL
	double end_time = clock();
	fprintf(stderr, "Time = %lf\n", (end_time - start_time) / CLOCKS_PER_SEC);
#endif

	return 0;
}


Measured memory_bytes: 34292