#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#else
#define dump(...)
#pragma GCC optimize ("O3")
template<class T>inline auto d_val(T a, T b) { return a; }
#endif

/* (=＾o＾=) */
// #define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
#define SORT(x) do{sort(ALL(x));}while(false)
#define RSORT(x) do{sort((x).rbegin(),(x).rend());}while(false)
#define UNIQUE(v) do{v.erase( unique(v.begin(), v.end()), v.end() );}while(false)
#define MAX(x,y) do{x = std::max(x,y);}while(false)
#define MIN(x,y) do{x = std::min(x,y);}while(false)
#define BR do{cout<<"\n";}while(false)

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::sort;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* constant value */
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* define hash */
namespace std { template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } }; }

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

//=============================================================================================

VL out;
unordered_map<ll, PAIR> mp;
VL v;
ll n;

list<ll> st(ll t) {
	if (out[t] < -1e6) { return {}; }

	auto lst = st(std::abs(out[t]));
	if (out[t] > 0) {
		lst.emplace_front(v[t]);
	}
	return lst;
}

ll f(ll t) {
	if (out[t] < -1e6) { return -1; }

	if (out[t] > 0) {
		return v[t];
	} else {
		f(-out[t]);
	}

}
signed main() {
	ll k;
	cin >> n >> k;
	v = VL(n);
	cin >> v;

	out = VL(n + 1);
	out[n] = -1e7;
	RREP(i, n) {
		if (mp.find(v[i]) == mp.end()) {
			mp[v[i]] = {i,0};
			out[i] = i + 1;
		} else {
			ll it = mp[v[i]].first + 1;
			out[i] = -it;
		}
		ll val = mp[v[i]].second + 1;
		mp[v[i]] = {i,val};
	}

	ll cnt = 1;
	ll t = f(0);
	VL ans;
	ans.emplace_back(0);
	while (true) {
		if (t == -1) { break; }
		ans.emplace_back(mp[t].first + 1);
		t = f(mp[t].first + 1);
		++cnt;
	}

	k = (k - 1 + cnt) % cnt;
	REPC(x, st(ans[k])) {
		cout << x << " ";
	}
	cout << endl;
	/**
	dump(ans, cnt);

	REPC(i, ans) {
		cout << f(i) << " -> ";
		REPC(x, st(i)) {
			cout << x << " ";
		}BR;
	}
	dump(out);
	/*//**/
}

Measured memory_bytes: 36292