Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100 * 1000 + 10;
map<pair<int, int>, pair<int, int> > mp;
int GCD(int a, int b);
int rev[Maxn];
int gcd[Maxn];
int w, m, n;
long long mn = 1ll << 60;
pair<int, int> ret;
void Rev(int);
map<pair<int, int>, pair<int, int> >::iterator it;
int main() {
  cin >> n >> m >> w;
  for (int i = 1; i <= max(m, n) + 1; i++) {
    Rev(i);
    gcd[i] = GCD(i, rev[i]);
  }
  for (int i = 1; i <= n; i++)
    mp[pair<int, int>(i / gcd[i], rev[i] / gcd[i])].first++;
  int p = 0, sum = 0;
  for (int i = n; i > 0; i--) {
    while (sum < w && p <= m) {
      p++;
      it = mp.find(pair<int, int>(rev[p] / gcd[p], p / gcd[p]));
      if (it != mp.end()) {
        sum += (*it).second.first;
        (*it).second.second++;
      }
    }
    if (p < m + 1 && mn > (long long)i * p)
      mn = (long long)i * p, ret = pair<int, int>(i, p);
    it = mp.find(pair<int, int>(i / gcd[i], rev[i] / gcd[i]));
    if (it != mp.end()) {
      sum -= (*it).second.second;
      (*it).second.first--;
      if ((*it).second.first == 0) mp.erase(it);
    }
  }
  if (mn == 1ll << 60)
    cout << -1 << endl;
  else
    cout << ret.first << " " << ret.second << endl;
  return 0;
}
void Rev(int i) {
  int t = i;
  while (t) {
    rev[i] *= 10;
    rev[i] += t % 10;
    t /= 10;
  }
}
int GCD(int a, int b) {
  if (b > a) swap(b, a);
  return b ? GCD(b, a % b) : a;
}