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 MX, MY, W;
class rational {
 public:
  int x, y;
  rational() {}
  rational(int x1, int y1) {
    x = x1;
    y = y1;
  }
  bool operator<(const rational r) const {
    return 1ll * x * r.y < 1ll * y * r.x;
  }
};
const int LEN = 100010;
map<rational, int> m1, m2;
rational r[LEN], rr[LEN];
int rev(int x) {
  int n = 0;
  while (x != 0) {
    n = n * 10 + x % 10;
    x /= 10;
  }
  return n;
}
int main() {
  cin >> MX >> MY >> W;
  for (int i = 0; i < LEN; i++) {
    r[i].x = i;
    r[i].y = rev(i);
    rr[i].x = r[i].y;
    rr[i].y = r[i].x;
  }
  for (int i = 1; i <= MX; i++) m1[r[i]]++;
  m2[rational(1, 1)] = 1;
  int minx = LEN + 1, miny = 1;
  int curw = m1[rational(1, 1)], cur = 1;
  if (curw >= W) {
    minx = MX;
    miny = 1;
  }
  int maxw = 0;
  for (int i = MX; i >= 1; i--) {
    while (cur < MY && curw < W) {
      cur++;
      m2[rr[cur]]++;
      curw += m1[rr[cur]];
    }
    if (maxw < curw) maxw = curw;
    if (cur == MY && curw < W) break;
    if (curw >= W && ((i * cur < minx * miny) || (minx > LEN))) {
      minx = i;
      miny = cur;
    }
    curw -= m2[r[i]];
    m1[r[i]]--;
  }
  if (minx > LEN)
    cout << "-1\n";
  else
    cout << minx << " " << miny << "\n";
  exit(0);
}
