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;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int rev[200005];
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
map<pair<int, int>, int> mpx;
map<pair<int, int>, int> mpy;
void init() {
  for (int i = 1; i <= 200000; i++) {
    int ans = i;
    int a = 0;
    while (ans) {
      a = ans % 10 + a * 10;
      ans /= 10;
    }
    rev[i] = a;
  }
}
int main() {
  init();
  int x, y, w;
  cin >> x >> y >> w;
  for (int i = 1; i <= y; i++) {
    pair<int, int> pi(i / gcd(i, rev[i]), rev[i] / gcd(i, rev[i]));
    mpy[pi]++;
  }
  int ans = 0;
  int posx, posy = y;
  for (posx = 1; posx <= x; posx++) {
    pair<int, int> pi(rev[posx] / gcd(rev[posx], posx),
                      posx / gcd(rev[posx], posx));
    mpx[pi]++;
    ans += mpy[pi];
    if (ans >= w) {
      break;
    }
  }
  int nmin = inf;
  int fx = -1;
  int fy = -1;
  if (ans >= w) {
    nmin = posx * y;
    fx = posx;
    fy = y;
  }
  int res = ans;
  while (true && posx <= x && posy >= 1 && res >= w) {
    pair<int, int> pi(posy / gcd(posy, rev[posy]),
                      rev[posy] / gcd(posy, rev[posy]));
    mpy[pi]--;
    res -= mpx[pi];
    while (res < w && posx + 1 <= x) {
      posx++;
      pair<int, int> pi(rev[posx] / gcd(rev[posx], posx),
                        posx / gcd(rev[posx], posx));
      mpx[pi]++;
      res += mpy[pi];
    }
    posy--;
    if (res >= w && posx * posy < nmin) {
      nmin = posx * posy;
      fx = posx;
      fy = posy;
    }
  }
  if (~fx && ~fy) {
    cout << fx << ' ' << fy << endl;
  } else
    cout << -1 << endl;
  return 0;
}
