Competitions

Prime numbers

Print all prime numbers from m to n inclusive.

Input

Two integers m and n (2mn300 000).

Output

Print the primes in ascending order, one per line. If between m and n inclusive there is no prime - print "Absent" (without the quotes).

Time limit 1 second
Memory limit 128 MiB
Input example #1
2 5

Output example #1
2
3
5

Input example #2
4 4

Output example #2
Absent