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 totalCases, testNum;
int rev[100001];
pair<int, int> aByRevA[100001];
map<int, int> pf[100001];
set<pair<int, int> > validwRank[100001];
map<pair<int, int>, vector<int> > mymap;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int reverse(int n) {
  int ret = 0;
  while (n > 0) {
    ret = ret * 10 + (n % 10);
    n /= 10;
  }
  return ret;
}
void preprocess() {
  for (int i = 1; i <= 100000; i++) rev[i] = reverse(i);
  aByRevA[1] = make_pair(1, 1);
  mymap[make_pair(1, 1)].push_back(1);
  for (int a = 2; a <= 100000; a++) {
    int reva = rev[a];
    int g = gcd(a, reva);
    pair<int, int> arg = make_pair(a / g, reva / g);
    aByRevA[a] = arg;
    mymap[arg].push_back(a);
  }
}
int mx, my, w;
bool input() {
  scanf("%d", &mx);
  scanf("%d", &my);
  scanf("%d", &w);
  return true;
}
void solve() {
  long long bestx, besty;
  bestx = mx + 1;
  besty = my + 1;
  long long found = 0;
  long long x, y;
  pair<int, int> argx, argy;
  y = my;
  for (x = 1; x <= mx; x++) {
    argx = aByRevA[x];
    argy = make_pair(argx.second, argx.first);
    int now = upper_bound(mymap[argy].begin(), mymap[argy].end(), y) -
              mymap[argy].begin();
    found += now;
    while (found >= w) {
      if (x * y < bestx * besty) {
        bestx = x;
        besty = y;
      }
      argy = aByRevA[y];
      argx = make_pair(argy.second, argy.first);
      now = upper_bound(mymap[argx].begin(), mymap[argx].end(), x) -
            mymap[argx].begin();
      found -= now;
      y--;
    }
  }
  if (bestx > mx) {
    cout << -1 << endl;
    return;
  }
  cout << bestx << " " << besty << endl;
}
int main() {
  preprocess();
  totalCases = 1;
  for (testNum = 1; testNum <= totalCases; testNum++) {
    if (!input()) break;
    solve();
  }
}
