Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int Rev[100001];
int maxX, maxY, W;
map<pair<int, int>, vector<int> > XSobreInv;
long long rev(int x) {
  if (Rev[x] != -1) return Rev[x];
  int y = 0;
  while (x) {
    y *= 10;
    y += x % 10;
    x /= 10;
  }
  return Rev[x] = y;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
pair<int, int> transforma(int x) {
  int inv = rev(x);
  int g = gcd(x, inv);
  x /= g;
  inv /= g;
  if (inv == 0) x = 1;
  return make_pair(x, inv);
}
int usei[100001];
int tenho(int x, int y) {
  int q = 0;
  pair<int, int> ok = transforma(x);
  swap(ok.first, ok.second);
  if (XSobreInv.count(ok)) {
    for (vector<int>::iterator it = XSobreInv[ok].begin();
         it != XSobreInv[ok].end(); it++) {
      if (*it <= y) {
        q++;
        usei[*it]++;
      } else {
        break;
      }
    }
  }
  return q;
}
void atualiza(long long &X, long long &Y, long long x, long long y) {
  if (x * y < X * Y) {
    X = x;
    Y = y;
  }
}
int main() {
  scanf("%d %d %d", &maxX, &maxY, &W);
  memset(Rev, -1, sizeof(Rev));
  XSobreInv.clear();
  for (int i = 1; i < 100001; i++) {
    int x = i;
    pair<int, int> p = transforma(x);
    XSobreInv[p].push_back(i);
  }
  memset(usei, 0, sizeof(usei));
  int total = 0;
  long long X = maxX + 1, Y = maxY + 1;
  for (int x = 1; x <= maxX; x++) {
    total += tenho(x, maxY);
    if (total >= W) {
      X = x;
      Y = maxY;
      break;
    }
  }
  if (X > maxX) {
    printf("-1\n");
    return 0;
  }
  int xat = X;
  for (int y = maxY; y >= 2; y--) {
    total -= usei[y];
    while (xat < maxX && total < W) {
      total += tenho(++xat, y - 1);
    }
    if (total >= W) {
      atualiza(X, Y, xat, y - 1);
    } else {
      break;
    }
  }
  cout << X << " " << Y << endl;
  return 0;
}