#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i, a, n) for(LL i = (a), i##_max = (n); i < i##_max; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##min = (a); i >= i##min; --i)
#define ALL(arr) (arr).begin(), (arr).end()
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(NULL); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
template <class T>
T Next() { T buf; cin >> buf; return buf; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "BinaryMatrix.h"
#include "BIT.h"
#include "Factorization.h"
#include "FlowSolver.h"
#include "Graph.h"
#include "LazySegmentTree.h"
#include "Math.h"
#include "Matrix.h"
#include "MinMax.h"
#include "Position.h"
#include "Range.h"
#include "Rational.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "SuffixArray.h"
#include "Tree.h"
#include "UnionFind.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
// template <class T>
// auto Is(const T& value) { return [value](const auto& comparand) -> bool { return comparand == value; }; }
#endif


LL N;
LL K;
int A[400000];
int nxt[200000];
map<int, vector<int>> mp;

LL times[200000];
LL period() {
	Fill(times, -1);
	int i = 0;
	LL cnt = 0;
	while (true) {
		if (times[i] >= 0) {
			assert(i == 0);
			return cnt - times[i];
		}
		times[i] = cnt;

		i += nxt[i] + 1;
		cnt += i / N;
		i %= N;
	}
}

void sim() {
	Fill(times, -1);
	int i = 0;
	LL cnt = 0;
	while (cnt < K - 2) {
		times[i] = cnt;
		i += nxt[i] + 1;
		cnt += i / N;
		i %= N;
	}

	int rem = (K - cnt) * N - i;
	map<int, int> mp;
	vector<int> v;
	REP(di, 0, rem) {
		int p = (i + di) % N;
		int val = A[p];
		if (mp[val] == 0) {
			++mp[val];
			v.push_back(val);
		} else {
			while (v.back() != val) {
				--mp[v.back()];
				v.pop_back();
			}
			--mp[v.back()];
			v.pop_back();
		}
	}

	for (int val : v) {
		cout << val << ' ';
	}
	cout << endl;
}

int main() {
	cin >> N >> K;
	REP(i, 0, N) cin >> A[i];
	REP(i, 0, N) A[i + N] = A[i];
	REP(i, 0, 2 * N) {
		mp[A[i]].push_back(i);
	}

	for (auto&& q : mp) {
		int val = q.first;
		const vector<int>& ps = q.second;
		REP(k, 0, ps.size()) {
			int p = ps[k];
			if (p >= N) break;
			nxt[p] = ps[k + 1] - ps[k];
		}
	}

	LL per = period();
	K %= per;
	sim();
	return 0;
}

Measured memory_bytes: 37492