eolymp
bolt
Try our new interface for solving problems
Problems

Splitting into factors

Splitting into factors

Time limit 1 second
Memory limit 64 MiB

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 data

Given two numbers N and M (2MN1000).

Output data

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 example #1
4 3
Output example #1
4
Input example #2
18 3
Output example #2
3*6
18