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 long long Inf = (long long)1e16;
const int N = 101000;
int x, y, w, a[N], b[N];
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int calc(int x) {
  int ret = 0;
  while (x) {
    ret = ret * 10 + x % 10;
    x /= 10;
  }
  return ret;
}
void init() {
  for (int i = 1; i < N; i++) {
    a[i] = i;
    b[i] = calc(i);
    int g = gcd(a[i], b[i]);
    a[i] /= g;
    b[i] /= g;
  }
}
int main() {
  init();
  cin >> x >> y >> w;
  map<pair<int, int>, int> m1, m2;
  int p, total = 0;
  for (p = 1; p <= x; p++) {
    m1[make_pair(b[p], a[p])]++;
  }
  p = x;
  int ax = -1, ay = -1;
  long long pro = Inf;
  for (int i = 1; i <= y; i++) {
    m2[make_pair(a[i], b[i])]++;
    total += m1[make_pair(a[i], b[i])];
    while (p > 1 && total - m2[make_pair(b[p], a[p])] >= w) {
      total -= m2[make_pair(b[p], a[p])];
      m1[make_pair(b[p], a[p])]--;
      p--;
    }
    if (total >= w && pro > (long long)p * i) {
      ax = p;
      ay = i;
      pro = (long long)p * i;
    }
  }
  if (pro == Inf) {
    puts("-1");
  } else {
    printf("%d %d\n", ax, ay);
  }
  return 0;
}
