#include <bits/stdc++.h>
using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
    return '"' + s + '"';
}

string to_string(const char* s) {
    return to_string((string) s);
}

string to_string(bool b) {
     return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
    bool first = true;
    string res = "{";
    for (int i = 0; i < static_cast<int>(v.size()); i++) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(v[i]);
    }
    res += "}";
    return res;
}

template <size_t N>
string to_string(bitset<N> v) {
    string res = "";
    for (size_t i = 0; i < N; i++) {
        res += static_cast<char>('0' + v[i]);
    }
    return res;
}

template <typename A>
string to_string(A v) {
    if(v.size() >= 100) {
        return "Too big container";
    }

    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define all(c) begin(c),end(c)
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; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> PINT;
typedef pair<ll,ll> PLL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
const long long INFLL = (1LL << 62) - 1;
const int INFI = (1 << 30) - 1;
template<typename T> void printv(vector<T>&v) {
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << " ";
    cout << v.back() << endl;
}
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
double deg2rad(double deg) { return deg * M_PI / 180; }
double rad2deg(double rad) { return rad * 180 / M_PI; }

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, k;
    cin >> n >> k;
    int a[200005], r[200005], b[200005];
    for(int i = 0; i < n; i++) r[i] = -1;
    for(int i = 0; i <= 200000; i++) b[i] = -1;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        if(b[a[i]] != -1){
            r[b[a[i]]] = i;
        }
        b[a[i]] = i;
    }
    for(int i = 0; i < n; i++){
        if(r[b[a[i]]] == -1) r[b[a[i]]] = i;
        b[a[i]] = i;
    }
    int u = 0;
    ll s = 0;
    for(int i = 0; i < n; i++){
        if(r[u] == u) s += n + 1;
        else s += (r[u] + n - u) % n + 1;
        u = (r[u] + 1) % n;
        if(u == 0) break;
    }
    k = k * n % s;
    for(int i = 0; i < n; i++){
        ll c;
        if(r[u] == u) c = n + 1;
        else c = (r[u] + n - u) % n + 1;
        if(k >= c){
            k -= c;
            u = (r[u] + 1) % n;
        }
        else{
            int ans[200005];
            int l = 0;
            while(k){
                ll c;
                if(r[u] == u) c = n + 1;
                else c = (r[u] + n - u) % n + 1;
                if(k >= c){
                    k -= c;
                    u = (r[u] + 1) % n;
                }
                else{
                    k--;
                    ans[l] = a[u];
                    u = (u + 1) % n;
                    l++;
                }
            }
            for(int j = 0; j < l; j++) cout << ans[j] << " ";
            cout << endl;
            return 0;
        }
    }
}


Measured memory_bytes: 6732