eolymp
bolt
Try our new interface for solving problems
Problems

Prime numbers

Prime numbers

Time limit 1 second
Memory limit 128 MiB

Print all prime numbers from m to n inclusive.

Input data

Two integers m and n~(2 \le m \le n \le 300000).

Output data

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

Examples

Input example #1
2 5
Output example #1
2
3
5
Input example #2
4 4
Output example #2
Absent