#include <fstream>
using namespace std;
#define maxn 3000005
int v[maxn],n,k;
ifstream cin("sdo.in");
ofstream cout("sdo.out");

void quicksort(int inf, int sup){
   int x,aux,i,j;
   i=inf;
   j=sup;
   x=v[(i+j)/2];
   while(i<=j){
    while(i<sup && v[i]<x) i++;
    while(j>inf && v[j]>x) j--;
    if(i<=j){
        aux=v[i];
        v[i]=v[j];
        v[j]=aux;
        i++; j--;
    }
   }
    if(i<sup) quicksort(i,sup);
    if(j>inf) quicksort (inf,j);
};

int main()
{
    cin>>n>>k;
    for(int i=1; i<=n; i++)
        cin>>v[i];
    quicksort(1,n);
    cout<<v[k]<<' ';
    return 0;
}