#include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1LL<<(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e,v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;

vector<int> calcStep(vector<int> &a, int size, int maxa) {
    vector<int> last(maxa, -1);
    for (int i = 0; i < size; i++) {
        if (last[a[i]] == -1)
            last[a[i]] = i + size;
    }
    vector<int> res(size);
    for (int i = size - 1; i >= 0; i--) {
        res[i] = last[a[i]] - i;
        last[a[i]] = i;
    }
    return res;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    cin >> A;
    auto step = calcStep(A, N, 200010);
    auto dp = make_v<int>(60, N);
    fill_v(dp, INF);
    for (int i = 0; i < N; i++) {
        dp[0][i] = step[i] + 1;
    }
    for (int i = 1; i < 60; i++) {
        for (int j = 0; j < N; j++) {
            int mid = (j + dp[i - 1][j]) % N;
            if (dp[i - 1][j] >= N * K)
                break;
            dp[i][j] = dp[i - 1][j] + dp[i - 1][mid];
        }
    }
    int L = N * K;
    int sum = 0;
    int pos = 0;
    bool update = true;
    while (update) {
        update = false;
        for (int i = 59; i >= 0; i--) {
            if (dp[i][pos] == INF) continue;
            if (sum + dp[i][pos] >= L)
                continue;
            sum += dp[i][pos];
            pos = (pos + dp[i][pos]) % N;
            update = true;
            break;
        }
    }
    vector<int> cnt(200010, 0);
    stack<int> st;
    for (int i = pos; i < N; i++) {
        if (cnt[A[i]]) {
            while (st.top() != A[i]) {
                cnt[st.top()]--;
                st.pop();
            }
            cnt[st.top()]--;
            st.pop();
        } else {
            cnt[A[i]]++;
            st.push(A[i]);
        }
    }
    vector<int> ans;
    while (!st.empty()) {
        ans.push_back(st.top());
        st.pop();
    }
    REV(ans);
    cout << ans << endl;
    
    return 0;
}

Measured memory_bytes: 105188