#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;


unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}


int main() {
    ll n;
    cin >> n;
    n += 2;
    ll k;
    cin >> k;
    vector<ll> z(n);
    vector<ll> fir(200002,-1);
    vector<ll> c(200002,-1);
    vector<ll> kk(n,-1);
    for (int i = 0; i < n; i++) {
        if (i >= n - 2)z[i] = 200001;
        else cin >> z[i];
        if (fir[z[i]] == -1)fir[z[i]] = i;
    }
    vector<int> bol(n);
    vector<ll> loop(n);
    for (int i = 0; i < n; i++) {
        if (c[z[i]] != -1) {
            kk[c[z[i]]] = i;
        }
        c[z[i]] = i;
    }
    for (int i = 0; i < n; i++) {
        if (kk[i] == -1) {
            kk[i] = n + fir[z[i]];
        }
    }
    for (int i = 0; i < n; i++) {
        kk[i]++;
    }
    for (int i = 0; i < n; i++) {
        if (bol[i] == 1) {
            continue;
        }
        vector<ll> t;
        ll ans = 0;
        ll p = i;
        while (1==1) {
            t.push_back(p);
            p = kk[p];
            ll xx = 0;
            if (p >= n) {
                ans = p - n;
                xx = 1;
            }
            if (xx == 1)break;
        }
        for (int j = 0; j < t.size(); j++) {
            bol[t[j]] = 1;
            loop[t[j]] = ans;
        }
    }
    for (int i = 0; i < n; i++) {
    }
    ll zans = 0;
    vector<ll> jon(n,-1);
    ll p = 0;
    ll q=0;
    ll r=0;
    for (int i = 0; i < 99999999; i++) {
        if (jon[p] != -1) {
            q = jon[p];
            r = i-jon[p];
            break;
        }
        jon[p] = i;
        p = loop[p];
    }
    
    ll loopzan=0;
    if(q >= k-1){
        loopzan = k-1;
        for (int i = 0; i < n; i++) {
            if (jon[i] == k - 1)zans = i;
        }
    }
    else {
        ll b = (k - 1) % r;
        for (int i = 0; i < n; i++) {
            if (jon[i] % r == b && jon[i] >= q) {
                zans = i;
            }
        }
    }
    vector<ll> ans;
    for (int i = zans; i < n; i++) {
        if (kk[i]-1 >= n)ans.push_back(z[i]);
        else { i = kk[i] - 1; }
    }
    for (int i = 0; i < ans.size(); i++) {
        cout << ans[i];
        if (i == ans.size() - 1)break;
        cout << " ";
    }
    cout << endl;
}

Measured memory_bytes: 13424