#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N; ll K;
int nex[61][MAX_N];
ll cost[61][MAX_N];

int A[MAX_N];
vector<int> G[MAX_N];

void solve() {
	cin >> N >> K;
	rep(i, 0, N) {
		cin >> A[i];
		A[i]--;
		G[A[i]].pb(i);
	}
	rep(i, 0, 200000) {
		if(G[i].empty()) continue;
		int a = G[i].front();
		rep(j, 0, sz(G[i]) - 1) {
			int now = G[i][j], to = G[i][j + 1];
			nex[0][now] = (to + 1) % N;
			cost[0][now] = to + 1 - now;
		}
		int b = G[i].back();
		nex[0][b] = (a + 1) % N;
		cost[0][b] = N - b + a + 1;
	}
	for(int i = 0; i < 60; i++) {
		rep(j, 0, N) {
			nex[i + 1][j] = nex[i][nex[i][j]];
			cost[i + 1][j] = cost[i][j] + cost[i][nex[i][j]];
			MIN(cost[i + 1][j], 1ll * N * K);
		}
	}
	// rep(i, 0, 10) {
	// 	rep(j, 0, N) {
	// 		debug(nex[i][j], cost[i][j]);
	// 	}
	// }
	ll tmp = 0;
	int at = 0;
	rer(i, 60, 0) {
		if(tmp + cost[i][at] < 1ll * N * K) {
			tmp += cost[i][at];
			at = nex[i][at];
		}
	}
	set<int> S;
	vector<int> vec;
	// debug(tmp);
	for(ll i = tmp; i < 1ll * N * K; i++) {
		ll idx = i % N;
		if(!S.count(A[idx])) {
			vec.pb(A[idx]);
			S.insert(A[idx]);
		}
		else {
			while(vec.back() != A[idx]) {
				S.erase(vec.back());
				vec.pop_back();
			}
			S.erase(A[idx]);
			vec.pop_back();
		}
	}
	rep(i, 0, sz(vec)) {
		cout << vec[i] + 1 << " ";
	}
	cout << "\n";
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 368116