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

题目大意：

给定一个n*m的乘法表，找第k大的数。

解题思路：

由于数据既大且多，暴力构造乘法表然后排序的做法不可取。正确做法是使用二分查找。由于乘法表有个特殊的公式，即对于一个数X，X除以行数i（i:1——n）设得到的结果（整数表示）为Q，如果Q大于列数M,那么这个数就大于第i行所有的数，如果等于列数，说明这个数是第i行第Q大的数。如果小于列数，说明这个数比第i行前Q个数大。利用这一点查找mid在乘法表中所处的位置，然后判断mid与k的大小关系进而确定左右边界继续二分，直到找到该位置（左等于右）。
代码如下：

#include<iostream>
using namespace std;
int main()
{
  long long n,m,k;
  cin>>n>>m>>k;
  long long l=1,r=n*m;
  while(l!=r)
  {
    long long mid=(l+r)/2,num=0;
    for(long long i=1;i<=n;i++)
    {
      long long q=mid/i;
      if(q>m)num+=m;
      else num+=q;
    }
    if(num>=k)r=mid;
    else l=mid+1;
  }
  cout<<l<<endl;
  return 0;
}