Transport belt
After completing their journey, our heroes arrived at the international airport in the capital of Colorovia, where they awaited their flight to Ukraine. With ample time on their hands, they headed to the terminal's observation deck to watch the unloading of a recently landed plane. They noticed that from the plane's door to the cargo reception department's door, a distance of L meters, the airport staff had constructed an automatic transport belt of length L, composed of two types of blocks with different lengths: X and Y meters.
Kotyhoroshko was curious about the question: "How many blocks of each type are needed to form the automatic transport belt so that their total number is minimal?" Help Kotyhoroshko find the solution to this problem.
Input
The first line of the input file contains two numbers X and Y—the lengths of the blocks, each specified to two decimal places (0.01 ≤ X, Y ≤ 25.00).
The second line contains one number L (0.01 ≤ L ≤ 10^9)—the distance from the plane's door to the cargo reception department's door, also specified to two decimal places.
Output
On a single line, output two numbers separated by a space: the number of blocks of the first type and the number of blocks of the second type. If it is impossible to construct a transport belt that exactly matches the specified distance, output the number 0.