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  
      
    
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
public class TestClass {
	static class Heap {
		long arr[][],di;
		int num;
		Heap(int a){
			arr = new long[a][2];
			num = 0;
			di = 0;
		}
		public void swap(long arr[][],int i,int j){
			long t = arr[i][0];
			arr[i][0] = arr[j][0];
			arr[j][0] = t;
			t = arr[i][1];
			arr[i][1] = arr[j][1];
			arr[j][1] = t;
		}
		public void Minheap(int a){
			while(a>0&&(arr[(a-1)/2][0]>arr[a][0]||(arr[(a-1)/2][0]==arr[a][0]&&arr[(a-1)/2][1]>arr[a][1]))){
				swap(arr,(a-1)/2,a);
				a = (a-1)/2;
			}
		}
		public void Minheapify(int a){
			int largest = a;
			if(2*a+1<num&&(arr[largest][0]>arr[2*a+1][0]||(arr[largest][0]==arr[2*a+1][0]&&arr[largest][1]>arr[2*a+1][1])))
				largest = 2*a+1;
			if(2*a+2<num&&(arr[largest][0]>arr[2*a+2][0]||(arr[largest][0]==arr[2*a+2][0]&&arr[largest][1]>arr[2*a+2][1])))
				largest = 2*a+2;
			if(largest!=a){
				swap(arr,a,largest);
				Minheapify(largest);
			}
		}
		public void insert(long a,long y){
			arr[num++][0] = a;
			arr[num-1][1] = y;
			Minheap(num-1);
		}
		public void deleteAtIndex(int a){
			long pi = arr[a][0];
			long i = arr[a][1];
			arr[a][0] = arr[num-1][0];
			arr[a][1] = arr[num-1][1];
			num--;
			if(arr[a][0]>pi||(arr[a][0]==pi&&arr[a][1]>i))
				Minheapify(a);
			else
				Minheap(a);
		}
		public long getMin(){
			long pi = arr[0][0];
			di = arr[0][1];
			deleteAtIndex(0);
			return pi;
		}
		public long getIndex(){
			return di;
		}
		/*public void deleteAtValue(int a){
			for(int i=0;i<num;i++){
				if(arr[i]==a){
					deleteAtIndex(i);
					break;
				}
			}
		}*/
	}
	private static InputStream stream;
	private static byte[] buf = new byte[1024];
	private static int curChar;
	private static int numChars;
	private static SpaceCharFilter filter;
	private static PrintWriter pw;
	public static void Merge(int a[][],int p,int r){
        if(p<r){
            int q = (p+r)/2;
            Merge(a,p,q);
            Merge(a,q+1,r);
            Merge_Array(a,p,q,r);
        }
    }
	
    public static void Merge_Array(int a[][],int p,int q,int r){
        int b[][] = new int[q-p+1][3];
        int c[][] = new int[r-q][3];
        for(int i=0;i<b.length;i++){
            b[i][0] = a[p+i][0];
            b[i][1] = a[p+i][1];
            b[i][2] = a[p+i][2];
        }
        for(int i=0;i<c.length;i++){
            c[i][0] = a[q+i+1][0];
            c[i][1] = a[q+i+1][1];
            c[i][2] = a[q+i+1][2];
        }
        int i = 0,j = 0;
        for(int k=p;k<=r;k++){
            if(i==b.length){
                a[k][0] = c[j][0];
                a[k][1] = c[j][1];
                a[k][2] = c[j][2];
                j++;
            }
            else if(j==c.length){
                a[k][0] = b[i][0];
                a[k][1] = b[i][1];
                a[k][2] = b[i][2];
                i++;
            }
            else if(b[i][0]<c[j][0]||(b[i][0]==c[j][0]&&b[i][1]<c[j][1])||(b[i][0]==c[j][0]&&b[i][1]==c[j][1]&&b[i][2]<c[j][2])){
                a[k][0] = b[i][0];
                a[k][1] = b[i][1];
                a[k][2] = b[i][2];
                i++;
            }
            else{
                a[k][0] = c[j][0];
                a[k][1] = c[j][1];
                a[k][2] = c[j][2];
                j++;
            }
        }
    }
    public static int count(int arr[],int m,int b[]){
    	if(m==arr.length)
    		return 0;
    	if(b[m]>0)
    		return b[m];
    	int in = m,max = 0;
    	long max2 = 0;
    	for(int i=m;i<arr.length;i++){
    		max = (int)(max+(long)arr[i])%1000000007;
    		max2 = ((max2+((i-in)+1)*(long)max)%1000000007+count(arr,m+1,b))%1000000007;;
    	}
    	b[m] = (int)(max2%1000000007);
    	return b[m];
    }
    public static boolean isPrime(int a){
    	if(a==1)
    		return false;
    	else if(a==2||a==3)
    		return true;
    	int i = 2;
    	for(i=2;i<=Math.sqrt(a);i++)
    		if(a%i==0)
    			return false;
    	return true;
    }
    public static long count(long mid,int n,int m){
    	long coun = 0;
    	for(int i=1;i<=n;i++)
    		coun+=Math.min((long)m, (mid-1)/(long)i);
    	return coun;
    }
	private static void soln() {
		int n = nextInt();
		int m = nextInt();
		long k = nextLong();
		long x = 1,y = n*(long)m,result = 0;
		while(x<=y){
			long mid = (x+y)/2;
			if(count(mid,n,m)<k){
				x = mid+1;
				result = mid;
			}
			else
				y = mid - 1;
		}
		pw.println(result);
	}
	public static void main(String[] args) {
		InputReader(System.in);
		int a[][] = new int[1000000][2];
		pw = new PrintWriter(System.out);
		soln();
		pw.close();
	}

	// To Get Input
	// Some Buffer Methods

	public static void InputReader(InputStream stream1) {
		stream = stream1;
	}

	private static boolean isWhitespace(int c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	private static boolean isEndOfLine(int c) {
		return c == '\n' || c == '\r' || c == -1;
	}

	private static int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	private static int nextInt() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	private static long nextLong() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	private static String nextToken() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	private static String nextLine() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isEndOfLine(c));
		return res.toString();
	}

	private static int[] nextIntArray(int n) {
		int[] arr = new int[n];
		for (int i = 0; i < n; i++) {
			arr[i] = nextInt();
		}
		return arr;
	}

	private static long[] nextLongArray(int n) {
		long[] arr = new long[n];
		for (int i = 0; i < n; i++) {
			arr[i] = nextLong();
		}
		return arr;
	}

	private static void pArray(int[] arr) {
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i] + " ");
		}
		System.out.println();
		return;
	}

	private static void pArray(long[] arr) {
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i] + " ");
		}
		System.out.println();
		return;
	}

	private static boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return isWhitespace(c);
	}

	private interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}

}