comefrom: <doocs>0668.Kth Smallest Number in Multiplication Table_1.py
code: def findKthNumber( m: int, n: int, k: int) -> int:
      left, right = 1, m * n
      while left < right:
          mid = (left + right) >> 1
          cnt = 0
          for i in range(1, m + 1):
              cnt += min(mid // i, n)
          if cnt >= k:
              right = mid
          else:
              left = mid + 1
      return left
masked: def sample_funcname ( var_0 : int , var_1 : int , var_2 : int ) -> int :
      var_3 , var_4 = 1 , var_0 * var_1
      while var_3 < var_4 :
          var_5 = ( var_3 + var_4 ) >> 1
          var_6 = 0
          for var_7 in range ( 1 , var_0 + 1 ) :
              var_6 += min ( var_5 // var_7 , var_1 )
          if var_6 >= var_2 :
              var_4 = var_5
          else :
              var_3 = var_5 + 1
      return var_3
  