#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

vector<lint> A;

void simulate(lint n, lint offset)
{
    set<lint> shown;
    vector<lint> ret;
    REP(i, n)
    {
        lint a = A[(i + offset) % A.size()];
        if (shown.count(a))
        {
            while (ret.back() != a)
            {
                shown.erase(ret.back());
                ret.pop_back();
            }
            shown.erase(ret.back());
            ret.pop_back();
        }
        else
        {
            shown.insert(a);
            ret.push_back(a);
        }
    }
    REP(i, ret.size()) printf("%lld ", ret[i]);
    puts("");
    exit(0);
}

int main()
{
    lint N, K;
    cin >> N >> K;
    A.resize(N);
    cin >> A;

    vector<int> nx(2 * N, N); // 何個先に同じのが出るか
    map<int, int> last_shown;
    IREP(i, N * 2)
    {
        if (last_shown.count(A[i % N]))
        {
            nx[i] = last_shown[A[i % N]] - i;
        }
        last_shown[A[i % N]] = i;
    }
    set<lint> h;
    lint now = 0;
    lint d0 = 0;
    while (true)
    {
        if (N * K - d0 < 1e6) simulate(N * K - d0, d0 % N);
        if (h.count(now)) break;
        h.insert(now);
        now = (now + nx[now] + 1) % N;
        d0 += nx[now] + 1;
    }

    lint circ = 0;
    lint tmp = now;
    while (true)
    {
        circ += nx[tmp] + 1;
        tmp = (tmp + nx[tmp] + 1) % N;
        if (tmp == now) break;
    }

    {
        lint now = d0 % N;
        lint rem = (N * K - d0) % circ;
        while (true)
        {
            if (rem < 1e6) simulate(rem, now);
            lint d = nx[now] + 1;
            now = (now + d) % N;
            rem -= d;
        }
    }
}


Measured memory_bytes: 34032