#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SZ(x) ((int)((x).size()))

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

template<class TH>
void _dbg(const char* name, TH val){
    clog << name << ": " << val << endl;
}
template<class TH, class... TA>
void _dbg(const char* names, TH curr_val, TA... vals) {
    while(*names != ',') clog << *names++;
    clog << ": " << curr_val << ", ";
    _dbg(names+1, vals...);
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
    #define dbg_arr(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg(...)
    #define dbg_arr(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

const int MAXN = 2e5 + 10;
LL vis[MAXN];
int nn[MAXN];
int A[MAXN];
int L;

int last_vis[MAXN];

vector<int> f(int pos, LL len) {
    dbg(pos, len);
    if (vis[pos]) {
        LL q = vis[pos]-len;
        len %= q;
    }
    vis[pos] = len;
    if (len == 0) return {};
    int d = nn[pos] - pos;
    if (d <= 0) d += L;
    if (len >= d+1) return f((nn[pos]+1)%L, len-d-1);
    vector<int> ans;
    set<int> inside;
    for (int i = pos; i < pos + len; i++) {
        int x = A[i%L];
        if (inside.count(A[i%L])) {
            while (!ans.empty() and ans.back() != x) {
                inside.erase(ans.back());
                ans.pop_back();
            }
            inside.erase(ans.back());
            ans.pop_back();
        } else {
            ans.push_back(x);
            inside.insert(x);
        }
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!

    LL K;
    cin >> L >> K;
    for (int i = 0; i < L; i++) cin >> A[i];

    for (int i = 4*L; i >= 0; i--) {
        nn[i%L] = last_vis[A[i%L]];
        last_vis[A[i%L]] = i % L;
    }

    auto ans = f(0, L*K);
    for (int x: ans) cout << x << " ";
    cout << "\n";
    
}


Measured memory_bytes: 62456