eolymp
bolt
Try our new interface for solving problems

Rats

To celebrate the Lunar New Year of the Rat, Douglas decides to count the number of rats living in his area. It is impossible for him to find all rats, as they tend to be well hidden. However, on the first day of the new year, Douglas manages to capture n1 rats, and marks each of them with an ear tag before releasing them. On the second day of the new year, Douglas captures n2 rats, and observes that n12 of them had been marked during the first day.

Douglas is asking for your help to estimate the total number of rats in his area. Looking up in your statistics textbook, you propose using the Chapman estimator N, given by:

prb9710.gif

where [x] is the floor of a real number x, i.e. the closest integer less than or equal to x.

Input

Consists of a single line, with three space-separated integers: n1, n2, n12 (0n1, n210000, 0n12 ≤ min(n1, n2)), in that order.

Output

Print a single line with the single integer N.

Time limit 1 second
Memory limit 128 MiB
Input example #1
15 18 11
Output example #1
24
Source 2019 ACM Southwestern Europe Regional Contest (SWERC), Paris, January 26 (2020), Problem I