You are given a multiplication table of size m$\times$n, where each element at position mat[i][j] is calculated as $i \times j$ (with 1-based indexing).

Your task is to find the $k^{th}$ smallest element in this table, given the m, n, and k values.

Constraints:

• $1 \leq$ m, n $\leq 3 \times 10^4$

• $1 \leq$ k $\leq$ m $\times$n