https://www.e-olymp.com/az/problems/830

/*
    Author: Kanan Asgarli
    https://www.e-olymp.com/az/problems/830
*/
#include <iostream>
#include <cmath>
#define MAX 300000
using namespace std;
int p[MAX+1], f, m, n;
void primes(){
    for(int i = 2; i <= (int)sqrt(MAX); i++)
        if(p[i] == 0)
            for(int j = i*i; j <= MAX; j += i)
                p[j] = 1;
    }
int main()
{
    primes();
    cin>>m>>n;
    for(int i = m; i <= n; i++ )
        if(p[i] == 0){
            f = 1;
            cout<<i<<endl;
        }
    if(f == 0)
        cout<<"Absent"<<endl;

    return 0;
}