Given positive integers , , and , compute the minimum possible value of given that must be a positive integer.
The input consists of a single line containing three space-separated integers , , and .
Print, on a single line, the minimum possible value of subject to the above constraint, rounded to exactly three decimal places.
The input data will be set such that the correct answer will not be within of the aforementioned rounding boundary.
Sample Input 1
31 41 59
Sample Output 1
Sample Input 2
3 4 5
Sample Output 2