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 P = 1000003;
const int maxn = 100005;
struct Node {
  long long a, b;
  bool operator<(const Node node) const { return a * node.b < b * node.a; }
  Node() {}
  Node(long long a, long long b) : a(a), b(b) {}
} a[maxn];
map<Node, int> M;
map<Node, vector<int> > MV;
int A, B, W;
long long C[maxn];
inline int lowbit(int x) { return x & (-x); }
void cha(int pos, int sz, long long val) {
  while (pos <= sz) {
    C[pos] += val;
    pos += lowbit(pos);
  }
}
long long he(int pos) {
  long long r = 0;
  while (pos > 0) {
    r += C[pos];
    pos -= lowbit(pos);
  }
  return r;
}
int rev(int x) {
  int r = 0;
  while (x) {
    r = r * 10 + (x % 10);
    x /= 10;
  }
  return r;
}
int R[maxn];
vector<int> vc[maxn];
void pre() {
  int i;
  for (i = 1; i < maxn; ++i) R[i] = rev(i);
  for (i = 1; i < maxn; ++i) a[i] = Node(i, R[i]);
  MV.clear();
  for (i = 1; i < maxn; ++i) {
    MV[Node(R[i], i)].push_back(i);
  }
  for (i = 1; i < maxn; ++i) {
    Node now = Node(i, R[i]);
    if (MV.find(now) != MV.end()) vc[i] = MV[Node(i, R[i])];
  }
}
pair<long long, long long> best, now;
void update(pair<long long, long long> a, pair<long long, long long> &best) {
  if (best.first < 0)
    best = a;
  else if (a.first * a.second < best.first * best.second)
    best = a;
}
void gao() {
  memset(C, 0, sizeof C);
  int i, j;
  best = make_pair(-1, -1);
  for (i = 1; i <= A; ++i) {
    for (j = 0; j < vc[i].size(); ++j) {
      cha(vc[i][j], B, 1);
    }
    int l, r, mid;
    l = 1;
    r = B;
    mid = (l + r) >> 1;
    while (l < r) {
      mid = (l + r) >> 1;
      long long ct = he(mid);
      if (ct < W)
        l = mid + 1;
      else
        r = mid - 1;
    }
    mid = min(B, mid + 2);
    while (he(mid) >= W) --mid;
    ++mid;
    if (mid <= B) {
      update(make_pair(i, mid), best);
    }
  }
  if (best.first < 0)
    puts("-1");
  else
    cout << best.first << ' ' << best.second << endl;
}
int main() {
  pre();
  while (cin >> A >> B >> W) {
    gao();
  }
  return 0;
}
