/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 2e5+10;
LL N,K;
int A[SIZE];
VI pos[SIZE];
LL lt[SIZE];
bool u[SIZE];
void inc(PLL& x){
    x.S++;
    if(x.S==N){
        x.F++;
        x.S=0;
    }
}
int stk[SIZE],sn;
void add(int x){
    if(u[x]){
        while(1){
            sn--;
            u[stk[sn]]=0;
            if(stk[sn]==x)break;
        }
    }
    else{
        stk[sn++]=x;
        u[x]=1;
    }
}
void start_with(PLL x){
    sn=0;
    while(1){
        add(A[x.S]);
        inc(x);
        if(x.F==K)break;
    }
    W(VI(stk,stk+sn));
    exit(0);
}
int main(){
    R(N,K);
    REP(i,N){
        R(A[i]);
        pos[A[i]].PB(i);
    }
    PLL now={0LL,0LL};
    MS1(lt);
    lt[0]=0;
    do{
        int v=A[now.S];
        PLL nxt{-1,-1};
        if(SZ(pos[v])==1){
            nxt={now.F+1,now.S};
        }
        else{
            int it=lower_bound(ALL(pos[v]),now.S)-pos[v].begin();
            it++;
            nxt.F=now.F;
            if(SZ(pos[v])==it){
                nxt.F++;
                it=0;
            }
            nxt.S=pos[v][it];
        }
        if(nxt.F>=K){
            start_with(now);
        }
        inc(nxt);
        if(nxt.F==K)return 0;
        now=nxt;
        if(lt[now.S]!=-1){
            LL dif=now.F-lt[now.S];
            now.F+=(K-1-now.F)/dif*dif;
            MS1(lt);
            lt[now.S]=now.F;
        }
        else lt[now.S]=now.F;
    }while(1);
    return 0;
}


Measured memory_bytes: 16512