Splitting into factors
Easy
Execution time limit is 1 second
Runtime memory usage limit is 64 megabytes
Given a positive integer N. You want to display all the partitions of N into positive divisors not smaller M and greater than 1.
Input
Given two numbers N and M (2 ≤ M ≤ N ≤ 1000).
Output
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.
Examples
Input #1
Answer #1
Input #2
Answer #2
Submissions 176
Acceptance rate 31%