#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int N = 2e5 + 10;
const int LOG = 55;

int a[N];

int fr[N];
int go[N][LOG];
ll sz[N][LOG];
const ll oo = 1e18 + 10;

ll bigsum(ll a, ll b) {
    ld ret = a + b;
    if (ret > oo)
        return oo;
    return a + b;
}
int n;

ll dist(int l, int r) {
    if (l >= r) {
        return n - l + r;
    }
    return r - l;
}

void smain() {

    ll k;
    cin >> n >> k;
    fori (i, n) {
        cin >> a[i];
        if (a[i] != a[0] && fr[a[i]] == 0) {
            fr[a[i]] = i;
        }
    }

    for (int i = n - 1; i >= 0; --i) {
        go[i][0] = (fr[a[i]] + 1) % n;
        sz[i][0] = dist(i, fr[a[i]]) + 1;
        fr[a[i]] = i;
    }

    for (int h = 1; h < LOG; ++h) {
        for (int i = 0; i < n; ++i) {
            go[i][h] = go[go[i][h - 1]][h - 1];
            sz[i][h] = bigsum(sz[i][h - 1], sz[go[i][h - 1]][h - 1]);
        }
    }


    int j = 0;
    ll need = n * k;
    while (true) {
        bool ok = false;
        for (int h = LOG - 1; h >= 0; --h) {
            if (sz[j][h] <= need) {
                need -= sz[j][h];
                j = go[j][h];
                ok = true;
                break;
            }
        }
        if (!ok)
            break;
    }

    set<int> have;
    vi cur;
    for (; j < n; ++j) {
        if (have.count(a[j])) {
            while (have.count(a[j])) {
                have.erase(cur.back());
                cur.pop_back();
            }
        } else {
            cur.push_back(a[j]);
            have.insert(a[j]);
        }
    }

    for (auto x : cur) {
        cout << x << ' ';
    }
}

Measured memory_bytes: 187504