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

int main(){
    int N;
    int64_t K;
    cin >> N >> K;
    vector<int> A(N);
    for(int i=0; i<N; i++) cin >> A[i];
    
    int last[200001];
    static int64_t dub[60][200000];
    for(int i=2*N-1; i>=0; i--){
        if(i<N) dub[0][i] = last[A[i]] - i + 1;
        last[A[i%N]] = i;
    }
    const int64_t INF = 1e18;
    for(int k=0; k<59; k++) for(int i=0; i<N; i++){
        int64_t d1 = dub[k][i];
        int j = (i+d1) % N;
        dub[k+1][i] = min(INF, d1 + dub[k][j]);
    }
    int64_t done = 0;
    for(int k=59; k>=0; k--){
        int64_t d = dub[k][done%N];
        if(done + d <= N*K) done += d;
    }

    vector<int> ans;
    bitset<200001> exist;
    while(done < N*K){
        int a = A[done%N];
        if(exist[a]){
            while(exist[a]){
                exist[ans.back()] = 0;
                ans.pop_back();
            }
        }else{
            exist[a] = 1;
            ans.push_back(a);
        }
        done++;
    }
    int sz = ans.size();
    for(int i=0; i<sz; i++) cout << ans[i] << " \n"[i==sz-1];
}
