#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll n,k;
int arr[200005];
vector<int> pos[200005];
int nxt[200005];

vector<int> fin;
bool used[200005];

int norm(int i){
	while (i<=0) i+=n;
}

int main(){
	cin>>n>>k;	
	
	for (int x=0;x<n;x++){
		cin>>arr[x];
		pos[arr[x]].push_back(x);
	}
	
	for (int x=0;x<200005;x++){
		for (int y=0;y<pos[x].size();y++){
			nxt[pos[x][y]]=pos[x][(y+1)%pos[x].size()];
		}
	}
	
	int period=1;
	int curr=0;
	
	while (curr!=n){
		if (nxt[curr]<=curr) period++;
		curr=nxt[curr];
		
		curr++;
	}
	
	k%=period;
	
	if (k==0) return 0;
	
	curr=0;
	while (k>1){
		if (nxt[curr]<=curr) k--;
		curr=nxt[curr]+1;
	}
	
	for (int x=curr;x<n;x++){
		if (used[arr[x]]){
			while (used[arr[x]]){
				used[fin.back()]=false;
				fin.pop_back();
			}
		}
		else{
			fin.push_back(arr[x]);
			used[arr[x]]=true;
		}
	}
	
	for (auto &it:fin) cout<<it<<" ";
}