#include<fstream>
using namespace std;
    ifstream f("sdo.in");
    ofstream g("sdo.out");
long n;

void quicksort(long a[], long left, long right){
    long i = left;
    long j = right;
    long aux;
    long pivot = a[(left + right)/2];

    while(i <= j){
        while(a[i] < pivot)
            i++;
        while(pivot < a[j])
            j--;
        if(i <= j){
            aux = a[i];
            a[i] = a[j];
            a[j] = aux;
            i++;
            j--;
        }
    }

    if(i < right)
        quicksort(a, i, right);
    if(j > left)
        quicksort(a, left, j);
}

int main()
{
long k;
f>>n>>k;
long a[n];
for(long i = 0 ; i < n ; i++)
    f>>a[i];

quicksort(a, 0, n - 1);

g<<a[k-1];

return 0;
}