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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)

template <typename T>
inline bool found(set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(unordered_set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(unordered_map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(vector<T> &s, T elem) { return find(s.begin(), s.end(), elem) != s.end(); }
inline int found(string &s, string t) { return (int)s.find(t); }
inline int found(string &s, int c) { return (int)s.find(c); }

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}

void render(vi& a){
    int M = a.size();
    rep(i,M){
        printf("%d%c", a[i], (i==M-1)? '\n':' ');
    }
}

void solve(int N, ll K, vi& a) {
    vvi occ(200001);
    rep(i,N){
        occ[a[i]].pb(i);
    }
    rep(x,200001){
        int L = occ[x].size();
        if (L == 0) continue;
        occ[x].resize(L*2);
        rep(i,L) {
            occ[x][L+i] = N + occ[x][i];
        }
    }
    vi nxt(N);
    rep(i,N){
        int ai = a[i];
        nxt[i] = *upper_bound(ALL(occ[ai]), i);
    }

    auto emu = [&](int ofs){
        if (ofs < 0) {
            cout << endl;
            return;
        }
        vi buf;
        map<int,int> occ;
        for (int i=ofs; i<N; ++i){
            int x = a[i];
            if (found(occ, x)) {
                int ix = occ[x];
                for (int h=buf.size()-1; h>=ix; --h) {
                    int y = buf.back();
                    occ.erase(y);
                    buf.pop_back();
                }
            } else {
                occ[x] = buf.size();
                buf.push_back(x);
            }
        }
        render(buf);
    };

    int k = 0, ofs = 0;
    map<int,int> visited;
    vi cyc(1, 0);
    visited[0] = 0;

    int cycle = -1;
    while (true) {
        while (true) {
            int n = nxt[ofs] + 1;
            if (n >= N) {
                if (k == K-1) {
                    emu(ofs);
                    return;
                }
                ofs = n-N; ++k;

                break;
            }
            ofs = n;
        }
        if (ofs == N) {
            visited[ofs] = k;
            cyc.pb(-1);
            ofs -= N;
            ++k;
        }
        if (found(visited, ofs)) {
            cycle = k - visited[ofs];
            break;
        }
        visited[ofs] = k;
        cyc.pb(ofs);
    }
    if (K-1 < cyc.size()) {
        emu(cyc[K-1]);
    } else {
        int dep = cyc.size() - cycle;
        ll rem = K-1 - dep;
        int k_ = dep + rem % cycle;
        emu(cyc[k_]);
    }
}

int main() {
    int N; ll K; scanf("%d %lld%*c", &N, &K);
    vi a(N);
    loadvec(a, N);
    solve(N,K,a);
    return 0;
}


Measured memory_bytes: 32756