<doocs>0668.Kth Smallest Number in Multiplication Table_1.py
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
def sample_funcname ( var_0 : int , var_2 : int , var_3 : int ) -> int :
    var_5 , var_6 = 1 , var_0 * var_2
    while var_5 < var_6 :
        var_7 = ( var_5 + var_6 ) >> 1
        var_9 = 0
        for var_11 in range ( 1 , var_0 + 1 ) :
            var_9 += min ( var_7 // var_11 , var_2 )
        if var_9 >= var_3 :
            var_6 = var_7
        else :
            var_5 = var_7 + 1
    return var_5
