//# pragma GCC optimize("Ofast,no-stack-protector")
//# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
/*
# include <ext/pb_ds/tree_policy.hpp>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/rope>
*/
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
# define int ll
using namespace std;

/*
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
Tree<int>tr;
*/

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# define LOCAL
# 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; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << 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 show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int gcd(int a, int b)
{
if(b) return gcd(b,a%b);
return a;
}mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

int n,k,tot,idx,a[1 << 18],viz[1 << 18],b[1 << 18],pos[1 << 18];
vector<int>vec[1 << 18];
int nxt[1 << 18],LST[1 << 18];
vector<int>ans;
int lst;

void GO()
{
	lst = 0;
	while(tot < n * k)
	{
		tot++;
		if(pos[a[idx]] != -1)
		{
			int targ = pos[a[idx]];
			for(int i = lst - 1;i >= targ;i--) pos[ans[i]] = -1;
			lst = targ;
			idx++;idx %= n;
		}
		else
		{
			ans[lst] = a[idx];
			pos[a[idx]] = lst;
			lst++;
			idx++;idx %= n;
		}
	}
}

void go()
{
	while(1)
	{
		int add;
		int f = nxt[idx];
		if(f > idx) add = f - idx;
		else add = n - idx + f;
		if(n * k <= tot + 1 + add)
		{
			GO();
			break;
		}
		idx += add + 1;idx %= n;
		tot += add + 1;
	}
}

int32_t main(){_
	//freopen("input","r",stdin);
	memset(pos,-1,sizeof(pos));
	cin >> n >> k;
	ans.resize(2 * n);
	for(int i = 0;i < n;i++)
	{
		cin >> a[i];
	}
	for(int i = n - 1;i + 1;i--)
	{
		LST[a[i]] = i;
	}
	for(int i = n - 1;i + 1;i--)
	{
		if(!sz(vec[a[i]])) nxt[i] = LST[a[i]];
		else nxt[i] = vec[a[i]].back();
		vec[a[i]].pb(i);
	}
	while(1)
	{
		int add;
		//cout << idx << ' ' << tot << '\n';
		if(viz[idx])
		{
			int rem = n * k - tot;
			int period = tot - b[idx];
			tot = n * k - (rem % period);
			go();
			break;
		}
		viz[idx] = 1;
		b[idx] = tot;
		int f = nxt[idx];
		if(f > idx) add = f - idx;
		else add = n - idx + f;
		if(n * k <= tot + 1 + add)
		{
			GO();
			break;
		}
		idx += add + 1;idx %= n;
		tot += add + 1;
	}
	for(int i = 0;i < lst;i++) cout << ans[i] << ' ';
	return 0;
}











Measured memory_bytes: 28800