codeforces 448D Multiplication Table（二分法)

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

 

 

（题意很迷，第k 大的数，如果是1234567，我认为第二大的数是6，不是2。题意是1234567中第二大的数是2）

在第i行中，比x小或等于x的数一共是有min（x/2,m）个。二分法，最小是1，最大是m*n.

 

第一次交这道题的时候犯迷糊，把left,right,mid写成了double类型，，，，

 

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
long long number(long long n,long long m,long long x)
{
    long long sum=0;
    for(int i=1;i<=n;i++)
    {
        sum+=min(x/i,m);
    }
    return sum;
}
int main()
{
    long long n,m,k,answer;
    scanf("%lld %lld %lld",&n,&m,&k);
    long long left=1,right=n*m,mid;
    while(left<=right)
    {
        mid=(left+right)/2;
        if(number(n,m,mid)>=k)
        {
            answer=mid;
            right=mid-1;
        }
        else
        {
            left=mid+1;
        }
    }
    printf("%lld\n",answer);
    return 0;
}