include[HTML_REMOVED]

using namespace std;
const int N=1e5+10;
int a[N];

int quick_sort(int l,int r,int k)
{
if(l==r) return a[l];
int i=l-1,j=r+1;
int x=a[(l+r)>>1];
while(i[HTML_REMOVED]x);
if(i[HTML_REMOVED]>n>>k;
for(int i=0;i[HTML_REMOVED]>a[i];
cout<<quick_sort(0,n-1,k)<<” “;
return 0;
}