Code forces 448D-----二分

Multiplication Table

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 448D

Description

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 ann × 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·10⁵; 1 ≤ k ≤ n·m).

Output

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

Sample Input

Input

2 2 2

Output

2

Input

2 3 4

Output

3

Input

1 10 5

Output

5

就是给定n*m的矩阵，每个位置的值等于它的横纵坐标乘积i*j，问n*m个数递增排列，第k个数是几，直接循环肯定超时，要用二分但首先要知道一个规律，才能用二分，这个我也是百度的，这种矩阵，

m是行数，n是列数，1=<i<=m，一个数x除以i，如果得出的数v大于列数n，他就比第i行所有数大，否则就比这一行的前v个数大

知道定理就好办了

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long m, n, k;
long long two(long long a){
	long long ans = 0;
	for(long long i = 1; i <= m; i++){
		if(a / i >= n){
			ans += n;
		}
		else{
			ans += a/i;
		}
	}
	return ans;
}
int main(){
	long long t, v, s, e, mid;
	while(~scanf("%lld%lld%lld", &m, &n, &k)){
		s = 0;
		e = k;
		while(e > s){
			mid = (s+e) >> 1;
			if(two(mid) >= k){
				e = mid;
			}
			else{
				s = mid+1;
			}
		}
		printf("%lld\n", s);
	}
	return 0;
}