include[HTML_REMOVED]

const int N=100010;
using namespace std;
int q[N];
int n,k;
int quick_sort(int l,int r,int k)
{
if(l>=r)return q[l];
int i=l-1,j=r+1,x=q[l+r>>1];
while(i[HTML_REMOVED]x);
if(i[HTML_REMOVED]=k)return quick_sort(l,j,k);
else return quick_sort(j+1,r,k-sl);
}
int main()
{
cin>>n>>k;
for(int i=0;i<n;i++) scanf(“%d”,&q[i]);
cout<<quick_sort(0,n-1,k)<<endl;
return 0;
}