#include <bits/stdc++.h>

using namespace std;

using i64 = int64_t;

const i64 MOD = (i64)1e9 + 7;

const i64 INF = (i64)1e18 + 7;


template <typename T = i64>
struct Range{
    struct iterator{
        T value;
        const T step, last;
        const T& operator*(){return value;}
        iterator(T value, T step, T last) :
            value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),
            step(step),
            last(last)
        {
        }
        iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}
        bool operator!=(const iterator& x){return value != x.value;}
    };
    const T start, last, step;

    Range(const T start, const T last, const T step = static_cast<T>(1)) :
        start(start),
        last(last),
        step(step)
    {
    }

    Range(const T last) :
        start(0),
        last(last),
        step(1)
    {
    }

    iterator begin(){return iterator(start, step, last);}
    iterator end(){return iterator(last, step, last);}
};

template <typename F>
struct FixPoint{
    const F _f;
    FixPoint(F&& f) : _f(forward<F>(f)){}

    template<typename... Types>
    decltype(auto) operator()(Types&&... args) const{
        return _f(*this, forward<Types>(args)...);
    }
};

template <typename F>
static decltype(auto) makeRec(F&& f){
    return FixPoint<F>(forward<F>(f));
}

template <typename T, T Value = T()>
vector<T> makeVector(size_t x){
    return vector<T>(x, T(Value));
}

template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args){
    return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));
}

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

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

#ifdef TEST
#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); cout << "value = " << x << endl;
#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);
#else
#define vecdump(x)
#define dump(x)
#endif


void _dump(int, string& x){
#ifdef TEST
    cout << x << endl;
#endif
}

template <typename T>
void _dump(bool, T& x){
#ifdef TEST
    cout << x << " ";
#endif
}

template <typename T, typename U = typename T::iterator>
void _dump(int, T& x){
#ifdef TEST
    for(auto& elm : x)
        _dump(0, elm);

    cout << endl;
#endif
}

template <typename T>
void _dump_macro(T& x){
    _dump(0, x);
}

void _input(int, string& x){
    cin >> x;
}

template <typename T>
void _input(bool, T& x){
    cin >> x;
}

template <typename T, typename U = typename T::iterator>
void _input(int, T& x){

    for(auto& elm : x)
        _input(0, elm);
}

template <typename T>
void input_single(T& x){
    _input(0, x);
}

auto input(){}

template <typename T, typename... Types>
void input(T& value, Types&&... args){
    input_single(value);
    input(forward<Types>(args)...);
};

void _pararell_input(size_t){}

template <typename T, typename... Types>
void _pararell_input(size_t index, T& value, Types&&... args){
    input(value[index]);
    _pararell_input(index, forward<Types>(args)...);
}

template <typename... Types>
void pararell_input(size_t count, Types&&... args){
    for(const auto& i : Range<>(count))
        _pararell_input(i, forward<Types>(args)...);
}


i64 solve(i64 _count){

    i64 n, k;
    input(n, k);

    if(!static_cast<bool>(cin))
        return MOD;
#ifdef TEST
    cout << "Case: " << _count << endl;
#endif

    vector<i64> a(n);
    input(a);
    /*
    srand(clock());
    auto f = [&](i64 l){
        vector<i64> v(l);
        for(i64 i = 0; i < l; ++i)
            v[i] = rand() % l;
        vector<i64> now;
        set<i64> s;
        for(i64 i = 0; i < 1e9; ++i){
            for(i64 i = 0; i < l; ++i){
                auto it = find(now.begin(), now.end(), v[i]);
                if(it == now.end())
                    now.emplace_back(v[i]);
                else
                    now.erase(it, now.end());
            }
            // vecdump(now);
            if(now.empty()){
                cout << i << endl;
                return i;
            }
            assert(s.find(now[0]) == s.end());
            s.emplace(now[0]);
        }
        return 0;
    };
    i64 ans = 0;
    for(i64 i = 0; i < 1e5; ++i){
        f(rand() % 100);
    }
    */

    i64 ma = 2e5 + 7;
    vector<set<i64>> m(ma);
    for(i64 i = 0; i < n; ++i)
        m[a[i]].emplace(i);

    vector<i64> v(n + 1);
    v[n] = -1;
    for(i64 i = n - 1; i >= 0; --i){
        auto it = m[a[i]].upper_bound(i);
        if(it == m[a[i]].end())
            v[i] = a[i];
        else
            v[i] = v[*it + 1];
    }
    vector<i64> w(ma, -1);
    for(i64 i = 0; i < ma; ++i)
        if(!m[i].empty())
            w[i] = v[*(m[i].begin()) + 1];

    i64 st = v[0];
    deque<i64> t(1, st);
    while(st != -1){
        st = w[st];
        t.emplace_back(st);
    }
    i64 mod = (k - 1) % t.size();
    t.pop_back();
    t.push_front(-1);
    i64 start = (t[mod] == -1 ? 0 : (*m[t[mod]].begin()) + 1);

    vector<i64> ans;
    while(start != n){
        auto iter = m[a[start]].upper_bound(start);
        if(iter == m[a[start]].end()){
            ans.emplace_back(a[start]);
            ++start;
        }
        else{
            start = *iter + 1;
        }
    }
    for(size_t i = 0; i + 1 < ans.size(); ++i)
        cout << ans[i] << " ";
    if(!ans.empty())
        cout << ans.back();
    cout << endl;

    return 0;
}


signed main(){

    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int t = 0;
    while(solve(++t) != MOD);
}


Measured memory_bytes: 28276