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 maxx series and more than maxy tickets in one series.

Input

The first line contains three integers maxx, maxy, w (1 ≤ maxx, maxy ≤ 105, 1 ≤ w ≤ 107).

Output

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.

Examples

Input

2 2 1


Output

1 1

Input

132 10 35


Output

7 5

Input

5 18 1000


Output

-1


Input

48 132 235


Output

22 111
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100 * 1000;
const long long INF = (1LL << 30) * (1LL << 30);
map<double, long long> M1;
map<double, long long> M2;
long long Mx, My;
long long W;
long long rev(long long x) {
  long long ret = 0;
  while (x) {
    ret *= 10;
    ret += x % 10;
    x /= 10;
  }
  return ret;
}
int main() {
  cin >> Mx >> My >> W;
  for (long long i = 1; i <= Mx; i++) M1[(double)i / (double)rev(i)]++;
  long long Ansa = -1;
  long long Ansb = -1;
  long long X = Mx;
  long long Y = 0;
  long long NOW = 0;
  while (X >= 1 && Y <= My) {
    if (NOW < W) {
      Y++;
      double TEMP = (double)rev(Y) / (double)Y;
      M2[TEMP]++;
      NOW += M1[TEMP];
    } else {
      if (Ansa == -1 || Ansa * Ansb > X * Y) Ansa = X, Ansb = Y;
      double TEMP = (double)X / (double)rev(X);
      NOW -= M2[TEMP];
      M1[TEMP]--;
      X--;
    }
  }
  if (Ansa == -1)
    cout << -1 << endl;
  else
    cout << Ansa << " " << Ansb << endl;
}
