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;
map<pair<int, int>, vector<int> > M;
map<pair<int, int>, int> Mcnt;
const long long inf = (long long)1E16;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int rev(int x) {
  int y = 0;
  while (x) {
    y = y * 10 + x % 10;
    x /= 10;
  }
  return y;
}
int main() {
  int mx, my, need, i, j, d, tx, ty;
  while (~scanf("%d%d%d", &mx, &my, &need)) {
    int cur = 0, cx = 1, cy = my;
    M.clear();
    Mcnt.clear();
    for (i = 1; i <= my; i++) {
      j = rev(i);
      int x = i, y = j;
      d = gcd(x, y);
      x /= d, y /= d;
      M[make_pair(x, y)].push_back(i);
    }
    long long res = inf;
    int rx = -1, ry = -1;
    for (; cx <= mx; cx++) {
      ty = cx, tx = rev(cx);
      d = gcd(tx, ty);
      tx /= d, ty /= d;
      cur += M[make_pair(tx, ty)].size();
      Mcnt[make_pair(tx, ty)]++;
      while (cy > 1 && cur >= need) {
        int x = cy, y = rev(cy);
        d = gcd(x, y);
        x /= d, y /= d;
        int dd = Mcnt[make_pair(x, y)];
        if (cur - dd < need) break;
        cur -= dd;
        M[make_pair(x, y)].pop_back();
        --cy;
      }
      if (cur >= need) {
        long long r0 = (long long)cx * (long long)cy;
        if (res > r0) {
          res = r0;
          rx = cx, ry = cy;
        }
      }
    }
    if (res == inf)
      printf("-1\n");
    else
      printf("%d %d\n", rx, ry);
  }
  return 0;
}
