#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
template<class T>bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void IN(void){return;}
template <typename First, typename... Rest> void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
inline void OUT(void){cout << "\n";return;}
template <typename First, typename... Rest> void OUT(First first, Rest... rest){cout << first << " ";OUT(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long LLINF = 1e18;
long long lcm(ll a, ll b){return a * b / __gcd(a,b);}
struct IoSetup { IoSetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
} } iosetup;
template< int mod > struct ModInt {
    int x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

const int MAXN = 2e5 + 10;
template< typename T > struct edge {
   int src, to; T cost;
   edge(int to, T cost) : src(-1), to(to), cost(cost) {}
   edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
   edge &operator=(const int &x) { to = x; return *this;}
   operator int() const { return to; }
};
template< typename T > using Edges = vector< edge< T > >;
template< typename T > using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T > using Matrix = vector< vector< T > >;

WeightedGraph<int> g;

pii dfs(int v, ll K){
    // cerr << v << endl;
    for(auto nv: g[v]){
        if(K - nv.cost > 0) return dfs(nv.to, K - nv.cost);
        else return mp(v, K);
    }
    return mp(-1,-1);
}
int dfs1(int v){
    // cerr << v << endl;
    for(auto nv: g[v]){
        if(nv.to == 0) return nv.src;
        return (dfs1(nv.to) + nv.src);
    }
    return 0;
}

set<int> st[MAXN];

int main(){
    iosetup;
    ll N, K; cin >> N >> K;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];
    rep(i, 0, N){
        st[A[i]].insert(i);
        st[A[i]].insert(N+i);
    }
    g.resize(N);
    // ll cnt = 1;
    rep(i, 0, N){
        auto it = st[A[i]].upper_bound(i);
        // if(*it >= N) cnt++;
        int src = 0;
        if(*it >= N) src = 1;
        int to = (*it +1)%N;
        int cost = *it - i + 1;
        g[i].push_back({src, to, cost});
    }
    ll cnt = dfs1(0) + 1;
    // cerr << cnt << endl;
    K *= N;
    K %= (cnt * N);
    // cerr << K << endl;
    auto tmp = dfs(0, K);
    int last = tmp.first;
    // cerr << last << " " << tmp.second << endl;
    stack<int> sk;
    set<int> ST;
    rep(i, last, last + tmp.second){
        if(ST.find(A[i % N]) == ST.end()){
            ST.insert(A[i%N]);
            sk.push(A[i%N]);
        }else{
            while(1){
                int x = sk.top();
                ST.erase(x);
                sk.pop();
                if(x == A[i%N]){
                    break;
                }
            }
        }
    }
    vector<int> ans;
    while(!sk.empty()){
        int x = sk.top(); sk.pop();
        ans.push_back(x);
    }
    reverse(ALL(ans));
    rep(i, 0, ans.size()){
        if(i != 0) cout << " ";
        cout << ans[i];
    }
    cout << endl;

    return 0;
}

Measured memory_bytes: 53236