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>, int> mp0, mp1;
int gcd(int x, int y) {
  if (y == 0)
    return x;
  else
    return gcd(y, x % y);
}
int rev(int x) {
  int ret = 0;
  while (x) {
    ret = ret * 10 + x % 10;
    x /= 10;
  }
  return ret;
}
pair<int, int> SpeMakePair(int x, int y) {
  int g = gcd(x, y);
  return make_pair(x / g, y / g);
}
int main() {
  int maxx, maxy, w, x, y, ansx, ansy, noww;
  cin >> maxx >> maxy >> w;
  for (int i = 1; i <= maxx; i++) mp0[SpeMakePair(i, rev(i))]++;
  x = maxx;
  y = 0;
  noww = 0;
  ansx = 0;
  while (x > 0) {
    if (noww < w) {
      if (y < maxy)
        y++, noww += mp0[SpeMakePair(rev(y), y)], mp1[SpeMakePair(rev(y), y)]++;
      else
        break;
    } else {
      if (ansx == 0 || x * y < ansx * ansy) ansx = x, ansy = y;
      noww -= mp1[SpeMakePair(x, rev(x))];
      mp0[SpeMakePair(x, rev(x))]--;
      x--;
    }
  }
  if (ansx == 0)
    cout << -1 << endl;
  else
    cout << ansx << " " << ansy << endl;
  return 0;
}
