include[HTML_REMOVED]

using namespace std;

const int N = 1e5+10;
int n;
int k;
int q[N];

void quick_sort(int q[] , int l ,int r)
{
if(l>=r) return;
int x = q[(l+r)/2] , i =l-1, j = r+1;
while(i < j)
{
do i++ ; while(q[i] < x);
do j– ; while( q[j] > x);
if(i < j) swap(q[i] , q[j]);
}
quick_sort(q , l , j);
quick_sort(q , j+1 , r);
}

int main()
{
scanf(“%d” , &n);
scanf(“%d” , &k);
for(int i = 0; i < n; i) scanf(“%d”,&q[i]);
quick_sort(q , 0 , n-1);
for(int i = 0; i < n ; i)
if (n = k ) printf(“%d “, q[(i = k-1)]);

return 0;

}