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;
vector<int> D;
int rev(int x) {
  if (D[x] != -1) return D[x];
  int p = 1;
  while (1) {
    if (p >= x) {
      if (p > x) p /= 10;
      break;
    }
    p *= 10;
  }
  int res = 0;
  while (x) {
    res += (x % 10) * p;
    p /= 10;
    x /= 10;
  }
  D[x] = res;
  return res;
}
int gcd(int a, int b) {
  while (b != 0) {
    int t = a % b;
    a = b;
    b = t;
  }
  return a;
}
int main() {
  istream &in = cin;
  D.resize(100001, -1);
  int mx, my, w, cnt = 0;
  in >> mx >> my >> w;
  map<pair<int, int>, int> MX, MY;
  long long x, y;
  for (x = 1; x <= mx; x++) {
    int rx = rev(x);
    int g = gcd(x, rx);
    if (x / g == 1 && rx / g == 1) {
      int tt = 0;
    }
    MX[make_pair(x / g, rx / g)]++;
  }
  int cw = 0;
  long long ax, ay;
  for (y = 1; y <= my; y++) {
    int ry = rev(y);
    int g = gcd(y, ry);
    pair<int, int> p = make_pair(ry / g, y / g);
    cw += MX[p];
    MY[p]++;
    if (cw >= w) break;
  }
  if (cw < w) {
    cout << -1;
    return 0;
  }
  x = mx;
  ax = x;
  ay = y;
  for (; x >= 1;) {
    int rx = rev(x);
    int g = gcd(x, rx);
    pair<int, int> px = make_pair(x / g, rx / g);
    int decr = MY[px];
    MX[px]--;
    x--;
    cw -= decr;
    if (cw >= w && x * y < ax * ay) {
      ax = x;
      ay = y;
    }
    if (cw < w) {
      bool ok = false;
      for (;;) {
        if (y == my) break;
        y++;
        int ry = rev(y);
        int g = gcd(y, ry);
        pair<int, int> py = make_pair(ry / g, y / g);
        int inc = MX[py];
        MY[py]++;
        cw += inc;
        if (cw >= w) {
          if (x * y < ax * ay) {
            ax = x;
            ay = y;
          }
          ok = true;
          break;
        }
      }
      if (!ok) {
        break;
      }
    }
  }
  cout << ax << " " << ay;
  return 0;
}
