#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;

int N, K;
int A[400010];
int step[60][200010];
int last[200010];

void _main() {
    cin >> N >> K;
    REP(i, N) {
        cin >> A[i];
        A[i]--;
        A[i + N] = A[i];
    }
    MINF(step);
    for (int i = 2 * N - 1; i >= 0; --i) {
        if (i < N)
            step[0][i] = last[A[i]] - i + 1;
        last[A[i]] = i;
    }
    for (int i = 0; i < 59; ++i) {
        for (int j = 0; j < N; ++j) {
            int k = (j + step[i][j]) % N;
            if (step[i][j] == INF || step[i][k] == INF)
                continue;
            CHMIN(step[i + 1][j], step[i][j] + step[i][k]);
        }
    }
    int now = 0;
    int rem = N * K;
    while (1) {
        bool update = false;
        for (int i = 59; i >= 0; --i) {
            if (step[i][now] <= rem) {
                rem -= step[i][now];
                now = (now + step[i][now]) % N;
                update = true;
                break;
            }
        }
        if (!update) break;
    }
    vector<int> cnt(200010, 0);
    stack<int> st;
    for (int i = now; i < N; ++i) {
        if (cnt[A[i]]) {
            while (st.top() != A[i]) {
                cnt[st.top()]--;
                st.pop();
            }
            cnt[A[i]]--;
            st.pop();
        } else {
            cnt[A[i]]++;
            st.push(A[i]);
        }
    }
    vector<int> ans;
    while (!st.empty()) {
        ans.push_back(st.top() + 1);
        st.pop();
    }
    REV(ans);
    cout << ans << endl;
}

signed main(signed argc, char **argv) {
    if (argc > 1) {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    _main();
    return 0;
}

Measured memory_bytes: 104356