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 gcd(int a, int b) {
  while (b) {
    int c = a % b;
    a = b;
    b = c;
  }
  return a;
}
pair<int, int> F(int n) {
  int m = 0;
  for (int i = n; i; i /= 10) m = m * 10 + i % 10;
  int d = gcd(n, m);
  return pair<int, int>(n / d, m / d);
}
const int N = 100000 + 10;
pair<int, int> a[N], b[N];
int main() {
  int n, m, w;
  scanf("%d %d %d", &n, &m, &w);
  map<pair<int, int>, int> A, B;
  for (int i = 1; i < N; ++i) {
    a[i] = F(i);
    b[i] = pair<int, int>(a[i].second, a[i].first);
  }
  int i = 1, j;
  int cnt = 0;
  for (j = 1; j <= m; ++j) B[a[j]]++;
  for (i = 1; i <= n; ++i) {
    A[a[i]]++;
    cnt += B[b[i]];
    if (cnt >= w) break;
  }
  if (cnt < w) {
    puts("-1");
    return 0;
  }
  j = m;
  while (true) {
    if (cnt - A[b[j]] < w) break;
    cnt -= A[b[j]];
    B[a[j]]--;
    --j;
  }
  int ret = i * j;
  int ret_i = i, ret_j = j;
  for (++i; i <= n; ++i) {
    A[a[i]]++;
    cnt += B[b[i]];
    while (true) {
      if (cnt - A[b[j]] < w) break;
      cnt -= A[b[j]];
      B[a[j]]--;
      --j;
    }
    if (i * j < ret) {
      ret = i * j;
      ret_i = i;
      ret_j = j;
    }
  }
  printf("%d %d\n", ret_i, ret_j);
  return 0;
}
