#include<bits/stdc++.h>
using namespace std;
int a[1000010], len;
struct Node{
	int cnt, num;
}anss[1000010];
int main(){
	int n, k;
	cin >> n >> k;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	sort(a + 1, a + 1 + n);
	int sum = 1;
	for(int i = 1; i < n; i++)
		if(a[i] != a[i + 1])
			anss[++len].num = a[i],
			anss[len].cnt = sum,
			sum = 1;
		else sum++;
	anss[++len].num = a[n];
	if(a[n] == a[n - 1])
		anss[len].cnt = sum;
	else
		anss[len].cnt = 1;
	for(int i = 1; i <= len; i++)
		if(anss[i].cnt > k)
			cout << anss[i].num << ' ';
	return 0;
}

萌新求助，n大概在1e6