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 MAXN = 100000 + 10;
int rev(int x) {
  int ret = 0;
  while (x != 0) {
    ret = ret * 10 + x % 10;
    x /= 10;
  }
  return ret;
}
int gcd(int x, int y) { return x == 0 ? y : gcd(y % x, x); }
pair<int, int> f[MAXN];
map<pair<int, int>, int> cnt, cntr;
void init() {
  for (int i = 1; i < MAXN; ++i) {
    int y = rev(i);
    int g = gcd(i, y);
    f[i] = make_pair(i / g, y / g);
  }
}
inline pair<int, int> rev(const pair<int, int> &p) {
  return make_pair(p.second, p.first);
}
int main() {
  int mx, my, mw;
  init();
  scanf("%d%d%d", &mx, &my, &mw);
  int x = mx + 1, y = my + 1;
  cnt.clear();
  cntr.clear();
  for (int i = 1; i <= my; ++i) {
    cnt[f[i]]++;
  }
  long long w = 0;
  for (int i = 1, j = my; i <= mx; ++i) {
    cntr[f[i]]++;
    w += cnt[rev(f[i])];
    if (w < mw) {
      continue;
    }
    while (j > 0 && w - cntr[rev(f[j])] >= mw) {
      w -= cntr[rev(f[j])];
      cnt[f[j]]--;
      j--;
    }
    if ((long long)i * j < (long long)x * y) {
      x = i;
      y = j;
    }
  }
  if (x != mx + 1) {
    printf("%d %d\n", x, y);
  } else {
    puts("-1");
  }
  return 0;
}
