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 maxint = 0x7fffffff;
map<pair<int, int>, vector<int> > have;
vector<int>::iterator it;
int maxx, maxy, w;
int tree[100000 * 8];
int reverse(int x) {
  int y = 0;
  while (x > 0) {
    y = y * 10 + x % 10;
    x /= 10;
  }
  return y;
}
int gcd(int x, int y) {
  if (x < y) swap(x, y);
  if (x % y == 0)
    return y;
  else
    return gcd(y, x % y);
}
void insert(int root, int l, int r, int x) {
  tree[root]++;
  if (l == r) return;
  int mid = (l + r) / 2;
  if (x <= mid)
    insert(root * 2, l, mid, x);
  else
    insert(root * 2 + 1, mid + 1, r, x);
}
int find(int root, int l, int r, int cnt) {
  if (cnt > tree[root]) return 0;
  if (l == r) return l;
  int mid = (l + r) / 2;
  if (cnt <= tree[root * 2])
    return find(root * 2, l, mid, cnt);
  else
    return find(root * 2 + 1, mid + 1, r, cnt - tree[root * 2]);
}
int main() {
  int i, y2, y3, g, x2, x3, ans, y, ax, ay;
  scanf("%d%d%d", &maxx, &maxy, &w);
  for (i = 1; i <= maxy; i++) {
    y2 = i;
    y3 = reverse(i);
    g = gcd(y2, y3);
    y2 /= g;
    y3 /= g;
    have[make_pair(y3, y2)].push_back(i);
  }
  ans = maxint;
  for (i = 1; i <= maxx; i++) {
    x2 = i;
    x3 = reverse(i);
    g = gcd(x2, x3);
    x2 /= g;
    x3 /= g;
    for (it = have[make_pair(x2, x3)].begin();
         it != have[make_pair(x2, x3)].end(); it++)
      insert(1, 1, maxy, *it);
    y = find(1, 1, maxy, w);
    if (y != 0)
      if (i * y < ans) {
        ans = i * y;
        ax = i;
        ay = y;
      }
  }
  if (ans == maxint)
    printf("-1\n");
  else
    printf("%d %d\n", ax, ay);
  return 0;
}
