A lot to Merge

Problem Statement

A lot to Merge Problem Description Nebula gives Groot two integers N and M together with a recipe for building a table of N rows and M columns. The entry where the i-th row meets the j-th column is the product i * j. Once the table is built, Nebula asks Groot to take all N * M entries of the table and arrange them in non-decreasing order. Repeated values are kept: a value that occurs t times in the table occupies t consecutive positions in the arranged list. Nebula then gives Groot an integer K and asks for the K-th value of that arranged list. Input Format Three lines: Line 1: the integer N, the number of rows. Line 2: the integer M, the number of columns. Line 3: the integer K, the 1-based rank to report. (inferred - the source shows the sample as the three labelled values N, M and K on separate lines, so the three integers are read one per line.) Output Format Print a single integer: the K-th value of the arranged list, followed by a newline. Constraints 1 <= N, M <= 10 4 1 &l