#include<stdio.h>
#include<queue>
#include<algorithm>
using namespace std;
struct P
{
int x;
friend bool operator<(P a,P b)
{
return a.x<b.x;
}
}s[1000000];
int main()
{
int n,i,j,a,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
priority_queue<int>q;
for(i=0;i<n;i++)
{
scanf("%d",&s[i].x);
q.push(s[i].x);
}
for(i=0;i<m-1;i++)
{
printf("%d ",q.top());
q.pop();
}
printf("%d\n",q.top());
q.pop();
}
return 0;
}
点击打开链接