#include <cstdio>
#include <queue>
#include <utility>
#define rep(i, d, u) for(int i = d; i <= u; ++i)
#define dep(i, u, d) for(int i = u; i >= d; --i)
int ured() {
	int ch, re = 0;
	do {
		ch = getchar();
	} while(ch < '0' || '9' < ch);
	do {
		re = re * 10 + (ch ^ '0');
	} while('0' <= (ch = getchar()) && ch <= '9');
	return re;
}
void uwit(int da) {
	int ch[21], cn = 0;
	do {
		ch[++cn] = da % 10;
	} while(da /= 10);
	do {
		putchar('0' ^ ch[cn]);
	} while(--cn);
}
const int _maxn = 200011;
int n, m, x[_maxn], rans[_maxn], hpos, tpos, firs[_maxn], neig[_maxn];
std :: priority_queue<std :: pair<int, int>> lasq, firq;
bool used[_maxn];
int main() {
	n = ured(), m = ured();
	rep(i, 1, n) {
		x[i] = ured();
	}
	dep(i, n, 1) {
		if(!firs[x[i]]) {
			lasq . push(std :: make_pair(-i, x[i]));
		}
		neig[i] = firs[x[i]], firs[x[i]] = i;
	}
	rep(i, 1, m) {
		while(used[lasq . top() . second]) {
			lasq . pop();
		}
		while(tpos < -lasq . top() . first) {
			++tpos;
			if(firs[x[tpos]] == tpos && !used[x[tpos]]) {
				firq . push(std :: make_pair(-x[tpos], tpos));
			}
		}
		while(firq . top() . second <= hpos) {
			std :: pair<int, int> tp = firq . top();
			firq . pop();
			if((firs[-tp . first] = neig[tp . second]) <= tpos) {
				firq . push(std :: make_pair(tp . first, neig[tp . second]));
			}
		}
		used[rans[i] = -firq . top() . first] = 1, hpos = firq . top() . second, firq . pop();
	}
	rep(i, 1, m) {
		uwit(rans[i]), putchar(i == m ? '\n' : ' ');
	}
	return 0;
}