Compote Preparation
Every year, Sovunya prepares compotes for herself and her friends to enjoy during the winter. The fruits she uses come from a tree that grows right where her house is. Everything would be perfect if the tree didn't keep growing, leading to larger and larger fruit harvests. One evening, while making compotes, she realized she couldn't keep up with the increasing amount of fruit.
Luckily, Pin had some free time, as the next update of Slackware Linux wasn't due soon, and he had already mastered the previous version. So, Pin helped Sovunya upgrade her equipment to automate the compote canning process, boosting productivity and making Sovunya's task more efficient. Along the way, Pin also helped Sovunya finish the supplies of fermented compote from the past two years. Being resourceful, Sovunya knew that fermented compote could be transformed into a true Elixir of Inspiration, so she always kept a stock of it.
Thanks to Pin's efforts, there are now K additional units of equipment, and the overall productivity of the setup has increased. Each unit has the same capacity, measured in jars per hour. Before the upgrade, Sovunya's production was N jars of compote per day, and after the upgrade, it became M jars per day. This doesn't mean there was any leftover compote — it just got consumed faster.
Write a program that, given the input numbers K, N, and M, determines how many compote units there could have been before the upgrade, and outputs all possible options in ascending order to the output file. It is guaranteed that possible options always exist.
Input
The input file contains the integers K, N, and M, each on a separate line.
0 < K, N, M ≤ 2000000000
Output
Write the possible numbers in ascending order, one number per line, in the output file.