Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Author: Fyodor Menshikov.
Difficulty Alpha
Prime numbers
Russian
Derive all the prime numbers from M to N , inclusive.
Input
You will have two numbers separated by a space M and N .
Output
List all the prime numbers between M and N. Print the prime numbers in ascending order, one per line.
If between M and N inclusive there is no prime number, write "Absent ".
Limitations
2 ≤ M ≤ N ≤ 300 000.
|
input 1
|
Input 2
|
2 5
|
4 4
|
|
Output 1
|
Output 2
|
2
3
5
|
Absent
|
Для отправки решений необходимо выполнить вход.
|