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
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class C70 {

    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        
        int X = in.nextInt(), Y = in.nextInt();
        int w = in.nextInt();
        int ansX = Integer.MAX_VALUE, ansY = Integer.MAX_VALUE;
        
        for (int i = 1; i <= Y; i++) if (i%10 != 0) {
            int r = rev(i);
            int g = gcd(i, r);
            long k = 1L*(i/g)*(MAX+1) + (r/g);
            if (!h.containsKey(k))
                h.put(k, new ArrayList<Integer>());
            h.get(k).add(i);
        }
        
        M = Y;
        t = new int[Y+1];
        int sum = 0;

        for (int i = 1; i <= X; i++) if (i%10 != 0) {
            int r = rev(i);
            int g = gcd(i, r);
            long k = 1L*(r/g)*(MAX+1) + (i/g);
            if (h.containsKey(k))
                for (int y : h.get(k)) {
                    modify(y, 1);
                    sum++;
                }
            
            if (sum < w) continue;
            
            int lo = 1, hi = Y;
            while (hi - lo > 0) {
                int cur = (lo + hi)/2;
                int s = get(cur);
                if (s >= w) hi = cur;
                else lo = cur+1;
            }
            
            if (1L*i*lo < 1L*ansX*ansY) {
                ansX = i;
                ansY = lo;
            }
        }
        
        if (ansX == Integer.MAX_VALUE) out.println("-1");
        else out.println(ansX + " " + ansY);
        
        out.flush();
    }
    
    static Map<Long, List<Integer>> h = new HashMap<Long, List<Integer>>();
    
    static int MAX = 100000;
    static int[] rev = new int[MAX+1];
    static {
        Arrays.fill(rev, -1);
    }
    
    static int M;
    static int[] t;

    static void modify(int x, int v) {
        t[x] += v;
        while ((x += x&(-x)) <= M) t[x] += v;
    }
    
    static int get(int x) {
        int res = t[x];
        while ((x -= x&(-x)) >= 1) res += t[x];
        return res;
    }

    static int rev(int x) {
        if (rev[x] != -1) return rev[x];
        StringBuilder X = new StringBuilder(x+"");
        return rev[x] = Integer.valueOf(X.reverse().toString());
    }
    
    static int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a%b);
    }
}
