include[HTML_REMOVED]

using namespace std;

const int N = 100010;

int n,k;
int q[N];

int quick_sort(int l,int r,int k )
{
if(l==r)
{
return q[l];
}
int x = q[l],i = l-1,j = r+1;
while(i[HTML_REMOVED]x);
if(i<j)
{
swap(q[i],q[j]);
}
}
int sl = j-l+1;
if(k<=sl)return quick_sort(l,j,k);
return quick_sort(j+1,r,k-sl);
}

int main()
{
cin >> n >> k;
for(int i=0;i[HTML_REMOVED]> q[i];
cout << quick_sort(0,n-1,k) << endl;
return 0;
}