CF70C.Lucky Tickets

In Walrusland public transport tickets are characterized by two integers: by the number of the series and by the number of the ticket in the series. Let the series number be represented by a and the ticket number — by b, then a ticket is described by the ordered pair of numbers (a, b).

The walruses believe that a ticket is lucky if a * b = rev(a) * rev(b). The function rev(x) reverses a number written in the decimal system, at that the leading zeroes disappear. For example, rev(12343) = 34321, rev(1200) = 21.

The Public Transport Management Committee wants to release x series, each containing y tickets, so that at least w lucky tickets were released and the total number of released tickets (x * y) were minimum. The series are numbered from 1 to x inclusive. The tickets in each series are numbered from 1 to y inclusive. The Transport Committee cannot release more than max__x series and more than max__y tickets in one series.

在海象国，公共交通车票由两个整数表征：系列编号与该系列内的票号。设系列编号为 $a$，票号为 $b$，则一张车票由有序对 $(a,\,b)$ 描述。

海象们认为一张车票是“幸运的”，当且仅当满足 $a \times b = \text{rev}(a) \times \text{rev}(b)$。其中函数 $\text{rev}(x)$ 表示将十进制表示的数 $x$ 的各位数字反转（反转后去除前导零）。例如，$\text{rev}(12343) = 34321$，$\text{rev}(1200) = 21$。

公共交通管理委员会计划发行 $x$ 个系列，每个系列包含 $y$ 张车票，要求至少发行 $w$ 张幸运车票，且总发行车票数 $x \times y$ 最小。系列编号从 $1$ 到 $x$（含端点），每个系列内的车票编号从 $1$ 到 $y$（含端点）。交通委员会最多只能发行 $\text{max\_x}$ 个系列，且每个系列最多只能包含 $\text{max\_y}$ 张车票。

The first line contains three integers max__x, max__y, w (1 ≤ max__x, max__y ≤ 105, 1 ≤ w ≤ 107).

第一行包含三个整数 $\text{max\_x}$、$\text{max\_y}$、$w$（$1 \leq \text{max\_x}, \text{max\_y} \leq 10^5$，$1 \leq w \leq 10^7$）。

Print on a single line two space-separated numbers, the x and the y. If there are several possible variants, print any of them. If such x and y do not exist, print a single number  - 1.

在一行中输出两个用空格分隔的数字，即 $x$ 和 $y$。如果存在多种可能的解，输出任意一个即可。如果不存在满足条件的 $x$ 和 $y$，则输出单个数字 $-1$。