Splitting into factors#2706
Given a natural number . It is required to output all partitions of into natural divisors not less than and greater than .
Two numbers and are given (2 \leq M \leq N \leq 1000).
Output all partitions into factors in lexicographic order. Partitions should be compared as sequences of numbers, not as strings. Within a partition, the factors should be listed in non-decreasing order.
Example 1
Example 2