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;
template <class T>
void pv(T a, T b) {
  for (T i = a; i != b; ++i) cerr << *i << ' ';
  cout << endl;
}
long long rev(long long x) {
  long long res = 0;
  for (; x; x /= 10) res = res * 10 + (x % 10);
  return res;
}
long long gcd(long long a, long long b) { return b != 0 ? gcd(b, a % b) : a; }
pair<long long, long long> gen(long long x, int s) {
  long long r = rev(x);
  long long g = gcd(x, r);
  x /= g;
  r /= g;
  if (s == 0)
    return make_pair(x, r);
  else
    return make_pair(r, x);
}
int main() {
  long long maxX, maxY, W;
  while (cin >> maxX >> maxY >> W) {
    map<pair<long long, long long>, int> countX, countY;
    for (int x = 1; x <= maxX; x++) {
      ++countX[gen(x, 0)];
    }
    long long best = maxX * maxY + 10;
    vector<int> res(2, -1);
    int curW = 0;
    long long y = 0;
    for (int x = maxX; x >= 1 && y <= maxY;) {
      if (curW >= W) {
        if (best > x * y) {
          best = x * y;
          res[0] = x;
          res[1] = y;
        }
      }
      if (curW < W) {
        y++;
        ++countY[gen(y, 1)];
        curW += countX[gen(y, 1)];
      } else {
        --countX[gen(x, 0)];
        curW -= countY[gen(x, 0)];
        x--;
      }
    }
    if (res[0] == -1)
      cout << res[0] << endl;
    else
      cout << res[0] << ' ' << res[1] << endl;
  }
  return 0;
}
