eolymp
bolt
Try our new interface for solving problems
Problems

Numbers

Numbers

Time limit 1 second
Memory limit 128 MiB

Young Andrew is playing yet another numbers game. Initially, he writes down an integer a. Then, he chooses some divisor d[1] of a (1 < d[1] < a), erases a and writes a[1] = a + d[1] instead. Then,he chooses some divisor d[2] of a[1] (1 < d[2] < a[1]), erases a[1] and writes a[2] = a[1] + d[2] instead.

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?

Input data

The only line contains two integers a and b (2a < b10^12).

Output data

If there's no solution, output "Impossible" (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 and b, then there exists a sequence with no more than 500 numbers in it.

Examples

Input example #1
12 57
Output example #1
12
18
24
36
48
54
57
Input example #2
3 6
Output example #2
Impossible
Source 2007 Petrozavodsk, Petr Mitrichev Contest 2, January 30, Problem E