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 INF = 0x3f3f3f3f, N = 2e5 + 5;
inline int read() {
  int sum = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -f;
    c = getchar();
  }
  while (c >= '0' && c <= '9') sum = sum * 10 + c - 48, c = getchar();
  return sum * f;
}
int mx, my, w, x, y, ansx, ansy;
int rev(int x) {
  int ans = 0;
  while (x) {
    ans = ans * 10 + x % 10;
    x /= 10;
  }
  return ans;
}
map<double, int> m1, m2;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> mx >> my >> w;
  for (int x = 1; x <= mx; x++) {
    double tmp = x * 1.0 / rev(x);
    m1[tmp]++;
  }
  x = mx;
  int cnt = 0;
  while (y <= my && x >= 1) {
    if (cnt < w) {
      y++;
      double tmp = rev(y) * 1.0 / y;
      cnt += m1[tmp];
      m2[tmp]++;
    } else {
      if (!ansx || x * y < ansx * ansy) {
        ansx = x;
        ansy = y;
      }
      double tmp = x * 1.0 / rev(x);
      cnt -= m2[tmp];
      m1[tmp]--;
      x--;
    }
  }
  if (!ansx)
    cout << -1 << '\n';
  else
    cout << ansx << ' ' << ansy << '\n';
  return 0;
}
