Long Python
One, two, left, right,
two by two — very simple
measuring the boas
five by five — any height
Parrot
After the Little Monkey and the Parrot had thoroughly measured the length of the Boa, they grew quite bored. Then, the Elephant remembered that there was also a Python living in the forest, which could be measured too! Excited by this new task, the friends set off to find it.
Just like the Boa, the Python is a whole entity, so it cannot be measured in halves. After measuring the Python, the Little Monkey and the Parrot discovered that the Python could accommodate n whole Parrots or m whole Little Monkeys. Thrilled with this finding, the Little Monkey dashed off to share the news with the Elephant. Meanwhile, the Parrot became curious about a particular question: how many times does he fit into one Little Monkey?
Since the Little Monkey had already left and he couldn't measure her directly, the Parrot decided to deduce how many whole Parrots could fit into one Little Monkey using the results from the Python measurements. Given n and m, determine the minimum and maximum number of whole Parrots that can fit into one Little Monkey.
Input
The input consists of two integers n and m, each on a separate line — representing the number of Parrots and Little Monkeys that fit into the Python, respectively (1 ≤ n, m ≤ 10^9).
Output
Output two numbers — the minimum and maximum number of whole Parrots that can fit into one Little Monkey.