#include <fstream>
#include <algorithm>

using namespace std;

ifstream in("sdo.in");
ofstream out("sdo.out");

 int n, k, i, j, v[3000001], iMin, maxim=-1, u, r=0;

int main ()
{
    in>>n>>k;

if (n==k)
{
    for (i=1; i<=n; i++)
    {
        in>>v[i];
        if (v[i]>maxim) maxim=v[i];
    }
    out<<maxim;
    return 0;
}

    while(n!=k)
    {
    for (i=1; i<=n; i++)
    {
        in>>v[i];
        if (v[i]>maxim) {maxim=v[i]; u=i;}
    }
        swap(v[u], v[n]);
        n--;
    maxim=-1;
    }
    sort (v+1, v+n+1); out<<v[k];

    return 0;
}