\includegraphics{https://static.e-olymp.com/content/21/21fec6b2c56fbb5195afdb28075549b3e4576a5a.jpg} Homer Simpson, a very smart guy, likes eating Krusty-burgers. It takes Homer \textbf{M} minutes to eat a Krusty-burger. However, theres a new type of burger in Apus Kwik-e-Mart. Homer likes those too. It takes him \textbf{N} minutes to eat one of these burgers. Given \textbf{T} minutes, you have to find out the maximum number of burgers Homer can eat without wasting any time. If he must waste time, he can have beer. \InputFile Each test case consists of three integers \textbf{M}, \textbf{N}, \textbf{T} (\textbf{1} ≤ \textbf{M}, \textbf{N}, \textbf{T} ≤ \textbf{1 000 000}). \OutputFile For each test case, print in a single line the maximum number of burgers Homer can eat without having beer. If homer must have beer, then also print the time he gets for drinking, separated by a single space. It is preferable that Homer drinks as little beer as possible.