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;
int maxx, maxy, w, l, r, ll, rr;
map<double, int> a, b;
long long min(long long l, long long r) {
  if (l < r)
    return l;
  else
    return r;
}
int rev(int k) {
  int sum = 0;
  while (k > 0) {
    int t = k % 10;
    k = k / 10;
    sum = sum * 10 + t;
  }
  return sum;
}
int main() {
  scanf("%d%d%d", &maxx, &maxy, &w);
  for (int i = 1; i <= maxx; i++) {
    double sum = (double)i / rev(i);
    a[sum] = a[sum] + 1;
  }
  l = maxx;
  r = 0;
  int s = 0;
  long long ans = 1e15;
  while ((l >= 1) && (r <= maxy)) {
    if ((s < w) && (r < maxy)) {
      r = r + 1;
      double sum = (double)rev(r) / r;
      s = s + a[sum];
      b[sum] = b[sum] + 1;
    } else if (s >= w) {
      if (ans > (long long)l * r) {
        ans = (long long)l * r;
        ll = l;
        rr = r;
      }
      double sum = (double)l / rev(l);
      s = s - b[sum];
      a[sum] = a[sum] - 1;
      l = l - 1;
    } else
      break;
  }
  if (ans == 1e15)
    printf("-1\n");
  else
    printf("%d %d\n", ll, rr);
  return 0;
}
