#include <iostream>
#include <cmath>

using namespace std;

int isPrime(int num);

int main()
{
    int n,m;
    cin>>n>>m;
    if(m<n){
        swap(n,m);
    }
    int mount=0;
    int num=0;
    for(num=2;;num++){
        if(isPrime(num)){
        mount++;
        if(mount>=n&&mount<=m){
            if(mount==m){
                cout<<num;
            }else if((mount-n+1)%10==0){
                cout<<num<<"\n";
            }else{
                cout<<num<<" ";
            }
        }
    }
    if(mount>m){
        break;
    }
    }
    return 0;
}

int isPrime(int num){
    for(int i=2;i<=(int)sqrt(num);i++){
        if(num%i==0){
            return 0;
        }
    }
    return num;
}