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 rev(int x) {
  int res = 0;
  while (x > 0) res *= 10, res += x % 10, x /= 10;
  return res;
}
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
pair<int, int> pt(int a, int b) {
  int g = gcd(a, b);
  return make_pair(a / g, b / g);
}
int main() {
  long long res = 1000000000000LL, rx, ry;
  int maxx, maxy, w, cur = 0;
  cin >> maxx >> maxy >> w;
  map<pair<int, int>, int> mx, my;
  for (int _n((maxx)), i(1); i <= _n; i++) mx[pt(i, rev(i))]++;
  for (int _n((maxy)), i(1); i <= _n; i++) my[pt(rev(i), i)]++;
  for (map<pair<int, int>, int>::iterator it = mx.begin(); it != mx.end(); it++)
    cur += it->second * my[it->first];
  int cx = maxx, cy = maxy;
  if (cur < w) {
    cout << -1 << endl;
    return 0;
  }
  rx = cx;
  ry = cy;
  res = (long long)(cx)*cy;
  while (cx >= 1) {
    pair<int, int> cd = pt(cx, rev(cx));
    if (cur - my[cd] >= w) {
      mx[cd]--;
      cur -= my[cd];
      cx--;
    } else
      break;
  }
  while (cx <= maxx && cy >= 1) {
    if (res > (long long)(cx)*cy) {
      res = (long long)(cx)*cy;
      rx = cx;
      ry = cy;
    }
    if (cy == 1 || cx == maxx) break;
    pair<int, int> a = pt(cx + 1, rev(cx + 1));
    pair<int, int> b = pt(rev(cy), cy);
    if (cur - mx[b] >= w) {
      my[b]--;
      cur -= mx[b];
      cy--;
    } else {
      mx[a]++;
      cur += my[a];
      cx++;
    }
  }
  cout << rx << " " << ry << endl;
  return 0;
}
