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
// practice with rainboy
import java.io.*;
import java.util.*;

public class CF70C extends PrintWriter {
	CF70C() { super(System.out, true); }
	Scanner sc = new Scanner(System.in);
	public static void main(String[] $) {
		CF70C o = new CF70C(); o.main(); o.flush();
	}

	int gcd(int a, int b) {
		return b == 0 ? a : gcd(b, a % b);
	}
	int rev(int a) {
		int r = 0;
		while (a > 0) {
			r = r * 10 + a % 10;
			a /= 10;
		}
		return r;
	}
	void main() {
		int n = sc.nextInt();
		int m = sc.nextInt();
		int w = sc.nextInt();
		int[] pp = new int[n + m];
		int[] qq = new int[n + m];
		for (int a = 1; a <= n; a++) {
			int r = rev(a), d = gcd(a, r);
			pp[a - 1] = a / d;
			qq[a - 1] = r / d;
		}
		for (int b = 1; b <= m; b++) {
			int r = rev(b), d = gcd(b, r);
			pp[n + b - 1] = r / d;
			qq[n + b - 1] = b / d;
		}
		Integer[] ii = new Integer[n + m];
		for (int i = 0; i < n + m; i++)
			ii[i] = i;
		Arrays.sort(ii, (i, j) -> pp[i] != pp[j] ? pp[i] - pp[j] : qq[i] - qq[j]);
		int z = 0;
		for (int i = 0; i < n + m; i++)
			pp[ii[i]] = i + 1 == n + m || pp[ii[i + 1]] != pp[ii[i]] || qq[ii[i + 1]] != qq[ii[i]] ? z++ : z;
		int[] kk = new int[z]; int[] ll = new int[z]; int k = 0;
		long ans = -1; int x_ = -1, y_ = -1;
		int j;
		for (j = n; j < n + m; j++)
			ll[pp[j]]++;
		j--;
		for (int i = 0; i < n; i++) {
			kk[pp[i]]++;
			k += ll[pp[i]];
			if (k < w)
				continue;
			while (j >= n && k - kk[pp[j]] >= w) {
				ll[pp[j]]--;
				k -= kk[pp[j]];
				j--;
			}
			int x = i + 1, y = j + 1 - n;
			if (ans == -1 || ans > (long) x * y) {
				ans = (long) x * y;
				x_ = x; y_ = y;
			}
		}
		if (ans == -1)
			println(-1);
		else
			println(x_ + " " + y_);
	}
}
