#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
set<int> s;
int a[200010];
int dp[200010];
vector<int> v[200010];
int main(){
	long long i,n,k;
	cin >> n >> k;
	for(i=0;i<n;i++){
		cin >> a[i];
		v[a[i]].push_back(i);
	}
	dp[n] = 0;
	for(i=n - 1;i>=0;i--){
		int x = a[i];
		if(v[x].back()==i){
			dp[i] = x;
		}else{
			int y = upper_bound(v[x].begin(),v[x].end(),i) - v[x].begin();
			dp[i] = dp[v[x][y] + 1];
		}
	}
	int l = 0,r = n;
	for(i=1;i<=n + 1;i++){
		if(l==0) l = dp[0];
		else l = dp[v[l][0] + 1];
		if(l==0){
			r = i;
			break;
		}
	}
	k = k%r;
	l = 0;
	for(i=1;i<k;i++){
		if(l==0) l = dp[0];
		else l = dp[v[l][0] + 1];
		if(l==0){
			r = i;
			break;
		}
	}
	vector<int> w;
	if(l!=0){
		w.push_back(l);
		s.insert(l);
	}
	for(i=0;i<n;i++){
		if(s.count(a[i])){
			while(1){
				int x = w.back();
				s.erase(x); w.pop_back();
				if(x==a[i]) break;
			}
		}else{
			s.insert(a[i]);
			w.push_back(a[i]);
		}
	}
	for(i=0;i<w.size();i++){
		cout << w[i] << " ";
	}
	cout << endl;
}
	