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 = 1e4 + 10;
const long long MOD = 1e6 + 3;
inline int in() {
  int x = 0, flag = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
  return x * flag;
}
map<double, int> Mapx, Mapy;
long long mx, my, w;
long long rev(long long x) {
  long long ret = 0;
  while (x) {
    ret = ret * 10 + x % 10;
    x /= 10;
  }
  return ret;
}
void upd(int flag, long long x) {
  if (flag == 0)
    Mapx[(double)rev(x) / (double)x]++;
  else
    Mapy[(double)rev(x) / (double)x]++;
}
void del(int flag, long long x) {
  if (flag == 0)
    Mapx[(double)rev(x) / (double)x]--;
  else
    Mapy[(double)rev(x) / (double)x]--;
}
int main() {
  mx = in(), my = in(), w = in();
  int x = 0, y = my;
  long long bx = -1, by = -1;
  long long ans = 0, best = 1e10;
  for (int i = 1; i <= my; i++) upd(1, i);
  while (x <= mx && y >= 1) {
    if (ans >= w && x * y < best) bx = x, by = y, best = x * y;
    if (ans < w) {
      x++;
      upd(0, x);
      ans += Mapy[(double)x / (double)rev(x)];
    } else if (ans >= w) {
      ans -= Mapx[(double)y / (double)rev(y)];
      del(1, y);
      y--;
    }
  }
  if (bx == -1)
    printf("-1\n");
  else
    cout << bx << " " << by << endl;
  return 0;
}
