Kth Smallest Number in Multiplication Table

class Solution {
public:
    int findKthNumber(int m, int n, int k) {
        auto countLE = [&](int v) {
            int total = 0;
            for (int i = 1; i <= m; ++i) total += min(v / i, n);
            return total;
        };
        int lo = 1, hi = m * n;
        while (lo < hi) {
            int mid = lo + (hi - lo) / 2;
            if (countLE(mid) < k) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }
};

func findKthNumber(m int, n int, k int) int {
    countLE := func(v int) int {
        total := 0
        for i := 1; i <= m; i++ {
            q := v / i
            if q > n {
                q = n
            }
            total += q
        }
        return total
    }
    lo, hi := 1, m*n
    for lo < hi {
        mid := lo + (hi-lo)/2
        if countLE(mid) < k {
            lo = mid + 1
        } else {
            hi = mid
        }
    }
    return lo
}

class Solution:
    def findKthNumber(self, m: int, n: int, k: int) -> int:
        def count_le(v: int) -> int:
            total = 0
            for i in range(1, m + 1):
                total += min(v // i, n)
            return total

        lo, hi = 1, m * n
        while lo < hi:
            mid = lo + (hi - lo) // 2
            if count_le(mid) < k:
                lo = mid + 1
            else:
                hi = mid
        return lo

function findKthNumber(m, n, k) {
    const countLE = (v) => {
        let total = 0;
        for (let i = 1; i <= m; i++) total += Math.min(Math.floor(v / i), n);
        return total;
    };
    let lo = 1, hi = m * n;
    while (lo < hi) {
        const mid = lo + Math.floor((hi - lo) / 2);
        if (countLE(mid) < k) lo = mid + 1;
        else hi = mid;
    }
    return lo;
}

class Solution {
    public int findKthNumber(int m, int n, int k) {
        int lo = 1, hi = m * n;
        while (lo < hi) {
            int mid = lo + (hi - lo) / 2;
            if (countLE(mid, m, n) < k) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }

    private int countLE(int v, int m, int n) {
        int total = 0;
        for (int i = 1; i <= m; i++) total += Math.min(v / i, n);
        return total;
    }
}

function findKthNumber(m: number, n: number, k: number): number {
    const countLE = (v: number): number => {
        let total = 0;
        for (let i = 1; i <= m; i++) total += Math.min(Math.floor(v / i), n);
        return total;
    };
    let lo = 1, hi = m * n;
    while (lo < hi) {
        const mid = lo + Math.floor((hi - lo) / 2);
        if (countLE(mid) < k) lo = mid + 1;
        else hi = mid;
    }
    return lo;
}