#include<bits/stdc++.h>
#define FOR(i, n, m) for(int i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = std::int_fast64_t;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long double eps = 1e-15;
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    REP(i, v.size()) {
        if(i) os << " ";
        os << to_string(v[i]);
    }
    return os;
}

struct modint {
    ll n;
public:
    modint(const ll n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while(m > 0) {
            if(m & 1) { r *= a; }
            a = (a * a); m /= 2;
        }
        return r;
    }
    modint &operator++() { *this += 1; return *this; }
    modint &operator--() { *this -= 1; return *this; }
    modint operator++(int) { modint ret = *this; *this += 1; return ret; }
    modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
    modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
    friend bool operator==(const modint& lhs, const modint& rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint& lhs, const modint& rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint& lhs, const modint& rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint& lhs, const modint& rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint& lhs, const modint& rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint& lhs, const modint& rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint& lhs, const modint& rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }

/*
#define MAX_N 1000000
long long extgcd(long long a, long long b, long long& x, long long& y) {
    long long d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
long long mod_inverse(long long a, long long m) {
    long long x, y;
    if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
    else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
    if(fact[0] == inf) {
        fact[0]=1;
        if(MAX_N != 0) fact[1]=1;
        for(ll i = 2; i <= MAX_N; ++i) {
            fact[i] = (fact[i-1] * i) % mod;
        }
    }
    e = 0;
    if(n == 0) return 1;
    long long res = mod_fact(n / mod, e);
    e += n / mod;
    if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
    return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
    if(n < 0 || k < 0 || n < k) return 0;
    long long e1, e2, e3;
    long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
    if(e1 > e2 + e3) return 0;
    return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}
 */

using mi = modint;
ll n, k;
vector<int> solve(vector<int>& a, ll pos) {
    vector<int> ans(n);
    int sz = 0;
    map<int, int> ma;
    FOR(i, pos, n) {
        if(ma[a[i]] > 0) {
            while(ma[a[i]] > 0) {
                ma[ans[sz - 1]]--;
                sz--;
            }
        } else {
            ans[sz] = a[i];
            ma[a[i]]++;
            sz++;
        }
    }
    ans.resize(sz);
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    vector<int> a(n);
    REP(i, n) cin >> a[i];
    if(n == 1) {
        if(k % 2) {
            cout << a[0] << endl;
        } else {
            cout << endl;
        }
        return 0;
    }
    vector<vector<int>> num(202020);
    REP(i, n) {
        num[a[i]].pb(i);
    }
    vector<int> nxt(n, -1);
    REP(i, 202020) REP(j, num[i].size()) {
        if(j == (int)num[i].size() - 1) {
            nxt[num[i][j]] = num[i][0];
        } else {
            nxt[num[i][j]] = num[i][j + 1];
        }
    }
    ll roop = 1, pos = 0;
    vector<ll> used(n, -1);
    vector<int> ans;
    while(1) {
        used[pos] = roop;
        if(roop == k) {
            ans = solve(a, pos);
            break;
        }
        int end = nxt[pos];
        if(nxt[pos] <= pos) roop++;
        if(end == n - 1 && roop == k) {
            cout << endl;
            return 0;
        }
        if(end != n - 1) {
            pos = end + 1;
        } else {
            pos = 0;
            roop++;
        }
        if(used[pos] != -1) {
            ll p = used[pos], q = roop - used[pos];
            ll d = (k - p) / q - 1;
            roop += d * q;
            while(1) {
                if(roop == k) {
                    ans = solve(a, pos);
                    break;
                }
                int end = nxt[pos];
                if(nxt[pos] <= pos) roop++;
                if(end == n - 1 && roop == k) {
                    cout << endl;
                    return 0;
                }
                if(end != n - 1) {
                    pos = end + 1;
                } else {
                    pos = 0;
                    roop++;
                }
            }
            break;
        }
    }
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 25856