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  
      
    


//package fastIO;

/*
 * Code Author: HONEY
 * DA-IICT
 */
import java.io.*;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.*;
public class A {

	static double eps = (double) 1e-6;
	static int mod = (int) 1e9 + 7;
	static long fac[] = new long[(int) 1e6];

	//	static HashSet<String> h=new HashSet<>();
	public static void main(String args[]) {
		InputReader in = new InputReader(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		//----------My Code----------
    
        long n=in.nextLong();
        long m=in.nextLong();
        long k=in.nextLong();         
        long ans=find(n,m,k,1,(n*m));
        
		out.println(ans);
		out.close();
		//---------------The End------------------

	}
	
	public static long find(long n,long m,long k,long l,long r)
	{
	    long result=-1,ans=-1;
	    while(l<=r)
	    {
	        long mid=(l+r)/2;
	        long rak=rank(n,m,mid);
	        // System.out.println(mid +" "+ rak);
	        if(rak==k)
	        {
	            ans=mid; 
	            l=mid+1;
	        }
	        else if(rak>k)
	        {
	            r=mid-1;
	        }
	        else
	        {
	            if(result==-1 || result <=rak)
	            {result=rak;ans=mid;}
	            l=mid+1;
	        }
	    }
	    return ans;
	        
	   
	}
	
	public static long rank(long n,long m,long e)
	{
	    
	    long i=1,j=m, count=0;
	    while(i<=n && j>=1)
	    {
	        
	        if((i*j)==e)
	        {
	                count =count+(j-1);
	                i++;
	                j--;
	                
	        }
	        else if((i*j)<e)
	        {
	            count=count+j;
	            i++;
	        }
	        else
	        {
	            j--;
	        }
	    }
	    
	  //  System.out.println(count);
	    return (count+1);
	}
	public static int pow(int x,int n)
	{
		if(n==1)return x%mod;
		if(n%2==0)
		{
			int r=pow(x,n/2);
			return (r*r)%mod;
		}
		else
		{
			int r=pow(x,n/2);
			return ((((x%mod)*r)%mod)*(r))%mod;
		}
	}

	public static void debug(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream inputstream) {
			reader = new BufferedReader(new InputStreamReader(inputstream));
			tokenizer = null;
		}

		public String nextLine() {
			String fullLine = null;
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					fullLine = reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return fullLine;
			}
			return fullLine;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

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

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