/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <iostream>
#include <fstream>

#ifndef  _TB
#define _TB

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define RFOR(i, b, a) for(int i = b - 1; i >= a; --i)
#define REP(i, N) FOR(i, 0, N)
#define RREP(i, N) RFOR(i, N, 0)

#define MIN(A, B) ((A) < (B) ? (A) : (B))
#define MAX(A, B) ((A) > (B) ? (A) : (B))
#define ABS(A) ((A) < 0 ? (-(A)) : (A))
#define ALL(V) V.begin(), V.end()
#define SIZE(V) (int)V.size()
#define pb push_back
#define mp make_pair
#define EPS 1e-7
#define Pi 3.14159265358979
#define FILL(a,v) memset(a,v,sizeof(a))

using namespace std;

typedef long long Long;
typedef unsigned long long ULong;
typedef unsigned int Uint;
typedef unsigned char Uchar;
typedef vector <int> VI;
typedef pair <int, int> PII;

#define X first
#define Y second

typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.X >> p.Y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.X << ' ' << p.Y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
ui logceil(int x) { return (ui)(8*sizeof(int)-__builtin_clz(x)); }

namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }

template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};

void fastIO(){ios::sync_with_stdio(false); }

template<typename T, typename... Args>
T max(T t, Args... args){ return max(max<T>(args...), t) ;}

template<typename T, typename... Args>
T min(T t, Args... args){ return min(min<T>(args...), t) ;}

#endif


const int MAXN = 200200;
const int MAXL = 70;

pair<int, Long> jump[MAXN][MAXL];



int ppos[MAXN];
int npos[MAXN];


Long n,k;

pair<Long, int> cnt(Long j) {
    Long cur = 0;
    int cp = 0;
    REP(i, MAXL) {
        if (cur > n*k)
            return {cur,-1};

        if (j%2 == 1) {
            cur += jump[cp][i].Y;
            cp = jump[cp][i].X;
        }
        j /= 2;
    }
    return {cur, cp};
}

class BDoNotDuplicate {
public:
    void solve(std::istream& in, std::ostream& out) {
        fastIO();


        in >> n >> k;
        VI a(n);

        in >> a;

        REP(i, n)
            ppos[a[i]] = i;

        REP(i, n) {
            npos[ppos[a[i]]] = i;
            ppos[a[i]] = i;
        }

        REP(i, n) {
            int np = npos[i];
            jump[i][0].X = (np+1)%n;
            if (np <= i)
                np += n;
            jump[i][0].Y = np - i+1;
        }


        FOR(u, 1, MAXL) {
            REP(i, n) {
                int np = jump[i][u-1].X;
                jump[i][u]= jump[np][u-1];
                jump[i][u].Y += jump[i][u-1].Y;
            }
        }

//        REP(i, 10) {
//            out << i <<
//        }

        Long t = k*n;
        Long l = 0;
        Long r = t+1;
        while (r - l > 1) {
            Long m = (l+r)/2;
            if (cnt(m).X > t)
                r = m;
            else
                l = m;
        }

//        REP(i, 10) {
//            out << i << " " << cnt(i) << endl;
//        }
//        return;

        Long left = t - cnt(l).X;
        Long start = cnt(l).Y;



        set<int> curs;
        VI cur;

        REP(u, left) {
            int i = start;
            if (curs.count(a[i])) {
                while (curs.count(a[i])) {
                    curs.erase(cur.back());
                    cur.pop_back();
                }
            } else {
                curs.insert(a[i]);
                cur.pb(a[i]);
            }
            start = (start+1)%n;
        }

        out << cur << endl;
    }
};


int main() {
	BDoNotDuplicate solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 232820