Time limit per test: 0.25
Memory limit: 65536
Young Andrew is playing yet another numbers game. Initially, he writes down an integer A
. Then, he chooses some divisor d1
, 1 < d1
, erases A
and writes A1
instead. Then, he chooses some divisor d2
, 1 < d2
, erases A1
and writes A2
I.e., at any step he chooses some positive integer divisor of the current number, but not 1 and not the whole number, and increases the current number by it.
Is it possible for him to write number B
if he started with number A
The only line of input contains two integers A
, 2 ≤ A
If there's no solution, output "
" (without quotes) to the only line of output. If there's one, output the sequence of numbers written starting with A
and ending with B
, one per line. You're not asked to find the shortest possible sequence, however, you should find a sequence with no more than 500 numbers. It is guaranteed that if there exists some sequence for the given A
, then there exists a sequence with no more than 500 numbers in it.