Given a positive integer N. You want to display all the partitions of N into positive divisors not smaller M and greater than 1.
Given two numbers N and M (2 ≤ M ≤ N ≤ 1000).
The output file you want to display all the partitions on the factors in the lexicographic order. Partitions should not be compared as strings, but as a sequence of numbers. Inside the split factors should go into nondecreasing order.