The Paratha Problem

Credits: 100

MacMohan, a very smart and sweet guy, likes eating Aloo Paratha (a variety of Paratha which is an Indian Dish). It takes MacMohan m minutes to eat an Aloo Paratha. However, there’s a new type of paratha in Appu’s Dhaba. MacMohan likes those too. It takes him n minutes to eat one of these parathas. Given t minutes, you have to find out the maximum number of parathas Homer can eat without losing any time. If he must lose time, he can have some juice.

Input

Input consists of several test cases. Each test case consists of three integers m, n, t (0 < m,n,t < 10000). Input is terminated by EOF.

Output

For each test case, print in a single line the maximum number of Parathas MacMohan can eat without having juice. If MacMohan must have juice, then also print the time he gets for drinking, separated by a single space. It is preferable that MacMohan drinks as little juice as possible. ( because of health reasons ).

Sample Input
3 5 54
3 5 55

Sample Output
18
17