int findlast(int q,int l,int r){
	int mid=l+(r-l)/2;
	if(l==r){
		if(q==a[r])
			return r;
		else
			return 0;
	}
	if(q>=a[mid])
		return findlast(q,mid,r);
	else
		return findlast(q,l,mid-1);
}