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 N = 203600;
char s[2000];
int rev(int first) {
  int n;
  sprintf(s, "%d%n", first, &n);
  reverse(s, s + n);
  sscanf(s, "%d", &first);
  return first;
}
int gcd(int first, int second) {
  return first ? gcd(second % first, first) : second;
}
map<int, int> MP;
pair<int, int> frac[N];
pair<int, int> recp[N];
map<pair<int, int>, int> cntx;
map<pair<int, int>, int> cnty;
int main() {
  for (int i = (1); i <= (int)(100000); i++) {
    int j = rev(i);
    int g = gcd(i, j);
    frac[i] = pair<int, int>(i / g, j / g);
    recp[i] = pair<int, int>(j / g, i / g);
  }
  int mx, my, w;
  scanf("%d%d%d", &mx, &my, &w);
  int cx, cy = 1;
  int ax, ay;
  long long tot = 1LL << 40;
  for (int first = (1); first <= (int)(mx); first++) cntx[recp[first]]++;
  long long cur = 0;
  for (cx = mx; cx; cx--) {
    while (cy <= my && cur < w) {
      cur += cntx[frac[cy]];
      cnty[frac[cy]]++;
      cy++;
    }
    if (cur >= w && (long long)cx * (cy - 1) < tot) {
      tot = (long long)cx * (cy - 1);
      ax = cx;
      ay = cy - 1;
    }
    cur -= cnty[recp[cx]];
    cntx[recp[cx]]--;
  }
  if (tot == (1LL << 40))
    puts("-1");
  else
    printf("%d %d\n", ax, ay);
  return 0;
}
