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 sys
# from functools import lru_cache, cmp_to_key
# from heapq import merge, heapify, heappop, heappush
# from math import *
# from collections import defaultdict as dd, deque, Counter as C
# from itertools import combinations as comb, permutations as perm
# from bisect import bisect_left as bl, bisect_right as br, bisect
# from time import perf_counter
# from fractions import Fraction
# import copy
# import time
# starttime = time.time()
# mod = int(pow(10, 9) + 7)
# mod2 = 998244353

# def data(): return sys.stdin.readline().strip()
# def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
# def L(): return list(sp())
# def sl(): return list(ssp())
# def sp(): return map(int, data().split())
# def ssp(): return map(str, data().split())
# def l1d(n, val=0): return [val for i in range(n)]
# def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
# try:
#     # sys.setrecursionlimit(int(pow(10,4)))
#     sys.stdin = open("input.txt", "r")
#     # sys.stdout = open("../output.txt", "w")
# except:
#     pass
# def pmat(A):
#     for ele in A:
#         print(*ele,end="\n")
# def seive():
#     prime=[1 for i in range(10**6+1)]
#     prime[0]=0
#     prime[1]=0
#     for i in range(10**6+1):
#         if(prime[i]):
#             for j in range(2*i,10**6+1,i):
#                 prime[j]=0
#     return prime


import math
 
def good(x):
    # Returns true if there are at least k table members <= x
    c = 0
    for i in range(1, n + 1):
        c += min(m, math.floor(x / i))
        if c >= k:
            return True
    return False
 
 
n, m, k = [int(x) for x in input().split(' ')]
 
if n * m == k:
    print(k)
 
else:
    l = 0
    r = k
 
 
    while r - l > 1 * ((10 ** 1) ** (int(n == 499997))):
        h = (l + r) // 2
        if good(h):
            r = h
        else:
            l = h
    print(r)


# endtime = time.time()
# print(f"Runtime of the program is {endtime - starttime}")
