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
from fractions import gcd
from collections import defaultdict
def do_rev(x):
	if x == 0: return 0
	r = int(str(x)[::-1])
	g = gcd(x, r)
	return (x / g, r / g)

(maxx, maxy, w) = map(int, raw_input().split())
rev = [do_rev(x) for x in xrange(max(maxx, maxy) + 1)]

ab = defaultdict(int)
ba = defaultdict(int)

for x in xrange(1, maxx + 1):
	ab[rev[x]] += 1


r = 0
cury = 0
res = (maxx, maxy)

def relax(x, y):
	global res
	if res[0] * res[1] > x * y:
		res = (x, y)

def inc_y(x):
	global r, cury
	for y in xrange(cury + 1, maxy + 1):
		(b, a) = rev[y]
		ba[(b, a)] += 1
		r += ab[(a, b)]
		if r >= w:
			cury = y
			relax(x, y)
			return
	cury = maxy

inc_y(maxx)
if r < w:
	print -1
	exit(0)


for x in xrange(maxx, 0, -1):
	(a, b) = rev[x]
	ab[(a, b)] -= 1
	r -= ba[(b, a)]
	if r >= w:
		relax(x - 1, cury)
		continue
	inc_y(x - 1)

print "%d %d" % res
