#include <iostream>
#include <cstdio>
using namespace std;
const int maxn=1000001;
int prime[maxn];
bool isprime[maxn]={false};
int primesize=0;
void findprime(){
for(int i=2;i<maxn;i++){
if(isprime[i]==true) continue;
prime[primesize++]=i;
for(int j=i+i;j<maxn;j+=i){
isprime[j]=true;
}
}
}
int main(int argc, char** argv) {
int n,m;
scanf("%d %d",&n,&m);
findprime();
int count=0;
for(int i=n;i<=m;i++){
printf("%d",prime[i-1]);
count++;
if(count%10!=0 && i!=m) printf(" ");
else putchar('\n');
}
return 0;
}
#include <cstdio>
using namespace std;
const int maxn=1000001;
int prime[maxn];
bool isprime[maxn]={false};
int primesize=0;
void findprime(){
for(int i=2;i<maxn;i++){
if(isprime[i]==true) continue;
prime[primesize++]=i;
for(int j=i+i;j<maxn;j+=i){
isprime[j]=true;
}
}
}
int main(int argc, char** argv) {
int n,m;
scanf("%d %d",&n,&m);
findprime();
int count=0;
for(int i=n;i<=m;i++){
printf("%d",prime[i-1]);
count++;
if(count%10!=0 && i!=m) printf(" ");
else putchar('\n');
}
return 0;
}