private int searchrow(int[][] matrix,int target,int b,int e)
	{
		if (b >= e)  return -1;
		if (b == e-1 ) return b;
		int mid = (b + e) /2;
		if (matrix[mid][0] <= target && target <= matrix[mid][matrix[mid].length -1] ) return mid;
		if (matrix[mid][0] > target ) return searchrow(matrix,target,b, mid);
		return searchrow(matrix,target,mid+1,e);
		
	}