#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define sz(x) x.size()
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<long,long> PLL;
typedef pair<char,char> PCC;
typedef long long ll;
const int N=2*1e5+10;
const int M=1e6+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
/*注意边界
清空每个case的影响
注意数据范围
注意证明*/
int a[N],n,k;
map<int,int> cnt;
bool check(int mid){
int tot=0;
for(auto p : cnt){
int u=p.x,v=p.y;
if(v>=mid){
tot+=v/mid;
}
if(tot>=k) return true;
}
return false;
}
void solve(){
cin>>n>>k;
rep(i,0,n) cin>>a[i],cnt[a[i]]++;
int l=1,r=n;
while(l<r){
int mid=l+r+1>>1;
if(check(mid)) l=mid;
else r=mid-1;
}
vector<int> ans;
for(auto p : cnt){
int u=p.x,v=p.y;
if(v>=l){
int c=v/l;
rep(i,0,c) if(sz(ans)!=k) ans.PB(u);
if(sz(ans)==k) break;
}
}
rep(i,0,sz(ans)) cout<<ans[i]<<' ';
}
int main(){
IOS;
//int t;cin>>t;
//while(t--)
solve();
return 0;
}