int binarySearch(int l,int r,int t){
if(l>r)
return -1;
int mid=l+(r-l)/2;
if(t==x[mid]) return mid;
else if(t>x[mid]) return binarySearch(mid+1,r,t);
else if(t<x[mid]) return binarySearch(l,mi-1,t);
}
int binarySearch(int l,int r,int t){
if(l>r)
return -1;
int mid=l+(r-l)/2;
if(t==x[mid]) return mid;
else if(t>x[mid]) return binarySearch(mid+1,r,t);
else if(t<x[mid]) return binarySearch(l,mi-1,t);
}