#include <stdio.h>
#include <iostream>
using namespace std;
int PNarray[10000] = {2}; //PNarray[0] = 2;
bool isPrimeNumber(int n, int PNarray[]){
for(int i = 0; PNarray[i] * PNarray[i] <= n; i++){
if(n % PNarray[i] == 0){
return false;
}
}
return true;
}
int main(){
int a, b;
scanf("%d %d", &a, &b);
int index = 1;
for(int i = 3; index < b; i += 2){ //建立到第b个数的素数表
if(isPrimeNumber(i, PNarray)){ //is prime number
PNarray[index++] = i; //store in prime number table
}
}
int count = 0;
for(int j = a - 1; j < b; j++){
if(count % 10 != 0){
printf("%c", ' ');
}
printf("%d", PNarray[j]);
count++;
if(count % 10 == 0){
printf("%c", '\n');
}
}
if(count % 10 != 0){
printf("%c", '\n');
}
return 0;
}