import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto K = RD;
	auto A = RDA;
	
	long[long] set;
	auto toList = new long[](N);
	toList.fill(-1);
	foreach (i; 0..N)
	{
		auto x = set.get(A[i], -1);
		if (x == -1)
		{
			set[A[i]] = i;
		}
		else
		{
			toList[x] = i;
			set[A[i]] = -1;
		}
	}

	long[] B, C;
	for (long i = 0; i < N; ++i)
	{
		if (toList[i] == -1)
		{
			B ~= A[i];
		}
		else
		{
			i = toList[i];
		}
	}
	foreach (key; set.keys)
	{
		if (set[key] == -1) continue;
		set[key] = -2;
	}
	for (long i = 0; i < N; ++i)
	{
		if (toList[i] == -2)
		{
			C.length = 0;
		}
		else if (toList[i] == -1)
		{
			C ~= A[i];
		}
		else
		{
			i = toList[i];
		}
	}

	long len;
	long[] ans;
	if (K % 2 == 0)
	{
		if (B.length != 0)
			len = (K-1) % B.length;
		ans = B[len..$];
	}
	else
	{
		if (C.length != 0)
			len = (K-1) % C.length;
		ans = C[len..$];
	}

	
	ans.map!(to!string).join(" ").writeln;

	stdout.flush();
	debug readln();
}
