#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

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

#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef gp_hash_table<int, int> umap;
typedef tree<int, null_type, less<int>, rb_tree_tag,
		tree_order_statistics_node_update> oset;
// not that imp
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<pii> vii;

#define inf 200000000000000
#define mod 1000000007
#define eps 1e-7
#define PI 3.1415926535897932385
// #define PI acos(-1)

#define pb push_back
#define bitc  __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define sz(x) (int)(x).size()

#define fr(i,a,b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i,n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (int i = n - 1; i >= 0; i--)
#define frr(i,a,b) for (int i = (a), _b = (b); i >= _b; i--)
#define foreach(it,ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fil(ar,val) memset(ar, val, sizeof(ar))

#ifdef bhartiya
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
	cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif

mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
inline bool equals(double a, double b) {return fabs(a - b) < 1e-9;}
int gcd(int a, int b){ return b==0 ? a : gcd(b, a%b); }
ll modpow(ll b, ll e) {
	ll ans=1; for(;e;b=b*b%mod,e/=2) if(e&1) ans=ans*b%mod; return ans;}

const int maxn = 200005;
int n;
int vis[maxn];
int a[maxn];
int ne[maxn];
int fir[maxn];
int last[maxn];

void brute(int cur, int cycles_left){
	trace(cur, cycles_left);
	while(true){
		// trace(cur, iter);
		// vis[cur] = iter;
		if((ne[cur])%n + 1 <= cur + 1){
			if(cycles_left == 0){
				if(ne[cur]%n + 1 == 1 && ne[cur] != cur) return;
				cout<<a[cur]<<" ";
				if(cur == n) return;
				else  {
					cur++;
					continue;
				}
			}
			else{
				cycles_left--;
			}
		}
		cur = (ne[cur])%n + 1;
		trace(cur, cycles_left, cur);
	}
}

void solve(){
	int k; cin>>n>>k;
	fr(i,1,n){
		cin>>a[i];
		if(last[a[i]] != 0) ne[last[a[i]]] = i;
		if(!fir[a[i]]) fir[a[i]] = i;
		ne[i] = fir[a[i]];
		last[a[i]] = i;
	}
	// fr(i,1,n){
	// 	cout<<ne[i]<<" ";
	// }
	int iter = 1, cur = 1;
	while(iter < k && vis[cur] == 0){
		// trace(cur, iter);
		vis[cur] = iter;
		if((ne[cur])%n + 1 <= cur + 1){
			if((ne[cur])%n + 1 == 1 && ne[cur] == cur){
				iter++;
			}
			iter++;
		}
		cur = (ne[cur])%n + 1;
		// trace(cur, iter, cur);
	}
	trace(iter, cur, vis[cur]);
	if(iter == k){
		brute(cur,0);
	}
	else if(iter < k){
		int cycles = iter - vis[cur];
		k -= vis[cur]-1;
		trace(k);
		int cycles_left = (k-1)%cycles;
		trace(cycles_left, iter, vis[cur]);
		trace(cycles_left, cycles, cur, vis[cur]);
		brute(cur, cycles_left);
	}
}

signed main() 
{ 
	ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0), cout.precision(10); //cout<<fixed;
    cin.exceptions(cin.failbit);
    #ifdef bhartiya
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    solve();
    end_routine();
}

Measured memory_bytes: 9088