class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
int n=matrix.length;
int m=matrix[0].length;
for(int i=0;i<n;i++){
int l=0,r=m;
while(l<r){
int mid=(l+r)/2;
if(matrix[i][mid]>=target)r=mid;
else l=mid+1;
}
if(l==m)continue;
if(matrix[i][l]==target)return true;
}
return false;
}
}