You have a rectangular cake of length and width . You want to divide it into equal-area rectangular pieces. Each cut must be parallel to the sides of the cake, and must completely split one of the existing pieces into two. (To divide the cake into pieces, you need exactly n-1 cuts.) You prefer pieces that are as close to square as possible, i.e., with the smallest possible aspect ratio. The "aspect ratio" of a piece is defined as the ratio of its longer side to its shorter side. You need to cut the cake so as to minimize the maximum aspect ratio among all pieces.
For example, a 2 \times 3 cake can be divided into pieces of size 1 \times 1. Each has aspect ratio , which is the minimum possible, so this is optimal. Another example: to cut a 5 \times 5 cake into pieces, one possible way is to first cut it into two pieces of sizes 2 \times 5 and 3 \times 5. Cut the smaller into two (2 \times 5/2 each), and the larger into three (3 \times 5/3 each). The largest aspect ratio is on the 3 \times 5/3 pieces: 3/(5/3) = 1.8. It is not possible to split a 5 \times 5 cake into equal-area pieces with a smaller maximum aspect ratio.
Multiple test cases are given, each on its own line, containing three integers: the length and width of the cake, and the number of pieces . It is guaranteed that 1 \leq \textbf{length}, \textbf{width} \leq 1000, 1 \leq \textbf{pieces} \leq 10.
Cut the cake so as to minimize the maximum aspect ratio among all pieces. For each test case, print this value in a separate line with digits after the decimal point. All pieces must have equal area.
Example 1