#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod



signed main(){

    int N, K; cin >> N >> K;
    vec A(N); cin >> A;

    int M = 200000;
    mat pos(M + 1);
    REP(i, N) pos[A[i]].pb(i);
    vec next(N);
    REP(i, M + 1){
        if(SZ(pos[i]) == 1) next[pos[i][0]] = pos[i][0];
        else if(SZ(pos[i]) >= 2){
            int n = SZ(pos[i]);
            REP(j, n) next[pos[i][j]] = pos[i][(j + 1) % n];
        }
    }

    vec r(N, -1);
    int t = 0;
    int now = 0;
    bool fin = false;
    while(true){
        if(next[now] <= now){
            if(t == K - 1) break;
            t++;
        }
        now = next[now];

        if(!fin){
            if(r[now] == -1) r[now] = t;
            else{
                int d = t - r[now];
                t += (K - 1 - t) / d * d;
                fin = true;
            }
        }

        now++;
        if(now == N){
            t++;
            if(t == K){
                Out("");
                return 0;
            }else now = 0;
        }
    }
    //vdebug(next);
    //vdebug(r);
    //debug(now);

    vec s;
    FOR(i, now, N){
        if(next[i] <= i) s.pb(A[i]);
        else i = next[i];
    }
    REP(i, SZ(s)) cout << s[i] << " ";
    cout << endl;


    return 0;
}


Measured memory_bytes: 18804