#include<iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
void qSort(long v[301],long st,long dr)
{
    long long mijl,minim,maxim,temp;
    mijl=v[st+(dr-st)/2];
    minim=st;maxim=dr;
    do
    {
        while(v[minim]<mijl) minim++;
        while(v[maxim]>mijl) maxim--;
            if(minim<=maxim)
        {
            temp=v[minim];
            v[minim++]=v[maxim];
            v[maxim--]=temp;
        }
    }while(minim<=maxim);
    if(st<maxim) qSort(v,st,maxim);
    if(dr>minim) qSort(v,minim,dr);
}

int main()
{
    long n,v[301],i,k;
    f>>n>>k;
    for(i=1;i<=n;i++)
        f>>v[i];
     nth_element(v+1, v+k+1, v+n+1);

        g<<v[k]<<"\n";

 return 0;
}