comefrom: <doocs>0074.Search a 2D Matrix_1.py
code: def searchMatrix( matrix: List[List[int]], target: int) -> bool:
      m, n = len(matrix), len(matrix[0])
      left, right = 0, m * n - 1
      while left < right:
          mid = (left + right) >> 1
          x, y = divmod(mid, n)
          if matrix[x][y] >= target:
              right = mid
          else:
              left = mid + 1
      return matrix[left // n][left % n] == target
masked: def sample_funcname ( var_0 : List [ List [ int ] ] , var_1 : int ) -> bool :
      var_2 , var_3 = len ( var_0 ) , len ( var_0 [ 0 ] )
      var_4 , var_5 = 0 , var_2 * var_3 - 1
      while var_4 < var_5 :
          var_6 = ( var_4 + var_5 ) >> 1
          var_7 , var_8 = divmod ( var_6 , var_3 )
          if var_0 [ var_7 ] [ var_8 ] >= var_1 :
              var_5 = var_6
          else :
              var_4 = var_6 + 1
      return var_0 [ var_4 // var_3 ] [ var_4 % var_3 ] == var_1
  