Compote Preparation

Every year, a cook prepares compote for herself and her friends to enjoy during the winter. The fruits she uses come from a tree that grows near her house. Everything would be fine if the tree did not keep growing, causing the fruit harvests to increase. One evening, while making compote, she realized she could not keep up with the growing number of fruits.

Fortunately, an engineer friend had no pressing business at that time, since the next update of Slackware Linux was not expected soon, and he had already mastered the previous version. So the engineer helped the cook improve her equipment, automating the compote preservation process to boost productivity and lighten her workload. He also helped her finish off the supply of fermented compote from the past two years. Being resourceful, the cook knew that fermented compote could be turned into a true Elixir of Inspiration, so she always kept a reserve.

As a result of the engineer's efforts, there are now $K$ more machines than before, and the total productivity has increased. All machines have identical productivity, measured in jars per hour. If, before the upgrade, the cook produced $N$ jars of compote per day, then after the upgrade she could produce $M$ jars per day. However, this does not mean that there was any leftover compote—people just started drinking it faster.

Write a program that, given $K$, $N$, and $M$, determines how many compote machines there could have been before the upgrade, and outputs all possible values in ascending order. You may assume that there is always at least one possible value.