# include <iostream>
# include <fstream>
# include <cstdlib>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
long long n, v[3000001], k, gasit;
void quickSort(long long left, long long right)
{
    long long pivot=v[(left+right)/2], i=left, j=right;
    while (i<=j)
    {
        while (v[i]<pivot)
            i++;
        while (v[j]>pivot)
            j--;
        if (i<=j)
        {
            long long aux=v[i];
            v[i]=v[j];
            v[j]=aux;
            i++;
            j--;
        }
    }
    if (k<=j)
        quickSort(left, j);
    else
    {
        if (k>=i)
            quickSort(i, right);
        else
            return;
    }
}
int main()
{
    f>>n>>k;
    long long i;
    for (i=1; i<=n; i++)
        f>>v[i];
    quickSort(1, n);
    g<<v[k];
}