include[HTML_REMOVED]

using namespace std;

const int N=100010;

int q[N];

int quick_find(int k,int l,int r)
{
if(l[HTML_REMOVED]>1];
while(i[HTML_REMOVED]x);
if(i<j)swap(q[i],q[j]);

}
if（k<=j+1)
{
    return quick_sort(k,l,j);
}
else
{
    return quick_sort(k,l,j+1);
}

}

int main ()
{
int n,k;
cin>>n>>k;
for(int i=0;i[HTML_REMOVED]>q[i];
}

cout<<quick_sort(k,0,n-1)<<endl;

}