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 maxn = 100000;
vector<int> p[maxn + 10];
map<int, int> l[maxn + 10], r[maxn + 10];
int pre[maxn + 10];
map<map<int, int>, int> s1, s2;
void prepare() {
  memset(pre, 0, sizeof(pre));
  for (int i = 2; i <= maxn; ++i)
    if (!pre[i]) {
      pre[i] = i;
      for (int j = i + i; j <= maxn; j += i) pre[j] = i;
    }
  for (int i = 2; i <= maxn; ++i) {
    if (pre[i]) p[i] = p[i / pre[i]];
    p[i].push_back(pre[i]);
  }
  map<int, int> tmp;
  for (int i = 1; i <= maxn; ++i) {
    int j = 0, k = i;
    while (k) {
      j = j * 10 + k % 10;
      k /= 10;
    }
    tmp.clear();
    for (int k = 0; k != p[i].size(); ++k) ++tmp[p[i][k]];
    for (int k = 0; k != p[j].size(); ++k) --tmp[p[j][k]];
    for (map<int, int>::iterator iter = tmp.begin(); iter != tmp.end(); ++iter)
      if (iter->second != 0) l[i][iter->first] = iter->second;
    tmp.clear();
    for (int k = 0; k != p[i].size(); ++k) --tmp[p[i][k]];
    for (int k = 0; k != p[j].size(); ++k) ++tmp[p[j][k]];
    for (map<int, int>::iterator iter = tmp.begin(); iter != tmp.end(); ++iter)
      if (iter->second != 0) r[i][iter->first] = iter->second;
  }
}
int main() {
  prepare();
  int maxx, maxy, w;
  cin >> maxx >> maxy >> w;
  for (int i = 1; i <= maxx; ++i) ++s1[l[i]];
  long long retx = 0, rety = 0;
  long long cnt = 0;
  for (long long i = maxx, j = 0; i > 0; --i) {
    while (j < maxy && cnt < w) {
      ++j;
      cnt += s1[r[j]];
      ++s2[r[j]];
    }
    if (cnt < w) break;
    if (i * j < retx * rety || retx * rety < w) {
      retx = i;
      rety = j;
    }
    cnt -= s2[l[i]];
    --s1[l[i]];
  }
  if (retx * rety < w)
    cout << -1;
  else
    cout << retx << " " << rety;
  return 0;
}
