Bizon the Champion isn't just charming, he also is very smart.

While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Champion painted an n × m multiplication table, where the element on the intersection of the i-th row and j-th column equals i·j (the rows and columns of the table are numbered starting from 1). Then he was asked: what number in the table is the k-th largest number? Bizon the Champion always answered correctly and immediately. Can you repeat his success?

Consider the given multiplication table. If you write out all n·m numbers from the table in the non-decreasing order, then the k-th number you write out is called the k-th largest number.

Input

The single line contains integers n, m and k (1 ≤ n, m ≤ 5·105; 1 ≤ k ≤ n·m).

Output

Print the k-th largest number in a n × m multiplication table.

Examples

Input

2 2 2


Output

2


Input

2 3 4


Output

3


Input

1 10 5


Output

5

Note

A 2 × 3 multiplication table looks like this:
    
    
      
    1 2 3  
    2 4 6  
      
    
/*
                              _                     _ 
                              _                     _ 
                            _ / |                 | \ _ 
                            _ / |         _       | \ _ 
                        _ / _   |       _ | \\    |   _ \ 
                        _ / _   |       _ | \ \   |   _ \ 
                    _ / _ / |   /     /         \ \   | \ _ \ _ 
                    _ / _ / |   /     /          \ \   | \ _ \ _ 
                _ / _ /     | /     /     _       \ \ |     \ _ \ _   
               _ / _ /      | /     /     _       \ \ |      \ _ \ _   
            _ / _ /         | |     |   |   \  O  / | |         \ _ \ _ 
           _ / _ /          | |     |   |    \   /  | |          \ _ \ _ 
          / _ /     |   |   | \     |   \ _   \|/   / |   |   |     \ _ \ 
         / _ /      |   |   | \     |   \ _    V    / |   |   |      \ _ \ 
        / /         |   |   |   \ _ /       \ _ _ /   |   |   |         \ \ 
       / /          |   |   |                         |   | | |          \ \ 
      / /       |   | | \     \       ROWECHEN      /     / | |   |       \ \ 
     / /    _ _ |   | | \     \        ZHONG        /     / | |   | _ _    \ \ 
    / / _ /   \ | | | |   \ / \ \                 / / \ /   | | | | /   \ _ \ \ 
   / / _ /    \ | | | |       \ \                 / /       | | | | /    \ _ \ \ 
  / / /         \ \ \ \ /       /                 \       \ / / / /         \ \ \ 
 \ / /          \ \ \ \ /       /                 \       \ / / / /          \ \ / 
  \|/             \|/         |         |         |           \|/             \|/ 
                  \|/         |         |   |     |           \|/ 
                              / _ |     |   | _     \ 
                              / _ |     |   | _     \ 
                            / / / _     | _ | | \ _   \ 
                            / / / _ |   | _ | | \ _   \ 
                            | / / | | / | | \ / | | \ | 
                            | / / | | / | | \ / | | \ |         
                              /   \ / | | | / | | / \ /           
                              /   \ / | | | / | | / \/           
                                  / | / \ |   \ /           
                                  / | / \ |    \/   
                                  \ /     |                                   
                                  \/      |                                                                   
*/
//TEMPLATE V2
	import java.io.*;
	import java.util.*;
	import java.math.*;
	
public class Main {
//Solution goes below: ------------------------------------

    public static void solution() throws IOException{
		long n = nextInt();
        long m = nextInt();
        long k = nextLong();
        long l = 1;
		long r = n * m + 1;
		long t = 0;
		long ans = 0;
        while (l < r) {
            t = l + r >> 1;//Div2.
            long cur = 0;//Number of elements in the table less than t.
            for (int i = 1; i <= n; i++){
				cur += Math.min(m, (t - 1) / i);
			}
            if (cur < k){
				ans = t;
				l = t + 1; 
			}else{
				r = t;
			}
        }
        println(ans);
    }

//Solution goes above: ------------------------------------
	public static final String IN_FILE = "";
	public static final String OUT_FILE = "";
//-------------------- ------------------------------------
	//IO
	public static BufferedReader br;
	public static StringTokenizer st;
	public static BufferedWriter bw;
    public static void main(String[] args) throws IOException{
		if(IN_FILE==""){
			br = new BufferedReader(new InputStreamReader(System.in)); 
		}else{
			try {
				br = new BufferedReader(new FileReader(IN_FILE));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}
		if (OUT_FILE==""){
			bw = new BufferedWriter(new OutputStreamWriter(System.out));
		}else{
			bw = new BufferedWriter (new FileWriter(OUT_FILE) );
		}
		solution();
		bw.close();//Flushes too.
	}

	public static String nextToken() {
		while (st == null || !st.hasMoreElements()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
		return st.nextToken();
	}

	public static String nextLine() {
		st = null;
		try {
			return br.readLine();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		return null;
	}

	public static int nextInt() {
		return Integer.parseInt(nextToken());
	}

	public static long nextLong() {
		return Long.parseLong(nextToken());
	}

	public static double nextDouble() {
		return Double.parseDouble(nextToken());
	}
	
	public static void println(Object s) throws IOException{
		bw.write(s.toString()+"\n");
	}
	
	public static void println() throws IOException{
		bw.newLine();
	}

    public static void print(Object s) throws IOException{
		bw.write(s.toString());
	}
	public static void flush() throws IOException{//Useful for debug
		bw.flush();
	}
	//Other
	public static class Arr<T> extends ArrayList<T> {} //I hate typing ArrayList
}