#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}


//Dijkstra
template<class T> class Dijkstra {
public:
	int N;
	T inf;
	vector<T> cost; 
	vector<vector<pair<T, int>>> edge;

	Dijkstra(const int N, T inf) : N(N), inf(inf),cost(N), edge(N) {
	}

	void make_edge(int from, int to, T w) {
		edge[from].push_back({ w,to });
	}

	void solve(int start) {
		for(int i = 0; i < N; ++i) cost[i] = inf;

		priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;
		cost[start] = 1;
		pq.push({ 1,start });

		while (!pq.empty()) {
			T v = pq.top().first;
			int from = pq.top().second;
			pq.pop();
			for (auto u : edge[from]) {
				T w = v + u.first;
				int to = u.second;
				if (w < cost[to]) {
					cost[to] = w;
					pq.push({ w,to });
				}
			}
		}
		return;
	}
};


int main() {
    ll N,K,Amax = 300000; cin >> N >> K;
    V<ll> A(N),B(N);

    for(int i = 0; i < N; ++i) cin >> A[i];
    
    V<V<ll>> cnt(Amax+1);
    for(int i = 0; i < N; ++i) cnt[A[i]].push_back(i);
    for(int i = 0; i <= Amax; ++i){
        
        for(int j = 0; j + 1 < cnt[i].size(); ++j){
            B[cnt[i][j]] = cnt[i][j+1];
        }
        if(cnt[i].size()){
            B[cnt[i].back()] = cnt[i].front();
        }
    }
    Dijkstra<ll> dijk(2*N,LOWINF);
    for(int i = 0; i < N - 1; ++i) dijk.make_edge(N+i,i+1,0);
    dijk.make_edge(N,0,1);   
    for(int i = 0; i < N; ++i) {
        dijk.make_edge(i,N+B[i],i>=B[i]);
    }
    dijk.solve(0);
    ll M = dijk.cost[2*N-1];

    corner(K%M==0,"");

    K %= M;
    ll t = 0;
    for(int i = 0; i < N; ++i) if(dijk.cost[i]==K) t = i;

    V<int> flg(Amax+1,0);
    V<int> ans;

    for(int i = t; i < N; ++i){

        if(flg[A[i]]){

            flg[A[i]] = 0;
            while(ans.size() && ans.back()!=A[i]) {
                flg[ans.back()] = 0;
                ans.pop_back();
            }
            if(ans.size()) ans.pop_back();
        }
        else{
            flg[A[i]] = 1;
            ans.push_back(A[i]);
        }

    }
    corner(ans.size()==0,"");

    for(auto e:ans) cout << e << " ";
    cout << endl;

    // for(int i = 0; i < N; ++i) cout << dijk.cost[i] << " "; cout << endl;
    // for(int i = 0; i < N; ++i) cout << dijk.cost[N+i] << " "; cout << endl;
   
    return 0;
}


Measured memory_bytes: 45048