#include <stdio.h>
#include <math.h>
#include <vector>
using namespace std;
int N,cnt = 0;
vector<int> primes;
int is_prime(int p)
{
int sq = sqrt(p);
for (int ps : primes) {
if(sq < ps)
return 1;
if(p % ps == 0)
return 0;
}
return 1;
}
void prime(int N)
{
int k = 0;
cnt += 2;
primes.push_back(2);
primes.push_back(3);
while (cnt < N) {
k++;
if(is_prime(6*k-1) == 1){
cnt ++;
primes.push_back(6*k-1);
}
if(is_prime(6*k+1) == 1){
cnt ++;
primes.push_back(6*k+1);
}
}
return;
}
int main() {
int a;
scanf("%d",&a);
scanf("%d", &N);
prime(N);
if(a == 1) printf("%d",primes[N-1]);
if(a == 0) for(int x : primes)
printf("%d ",x);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxtYXRoLmg+CiNpbmNsdWRlIDx2ZWN0b3I+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IE4sY250ID0gMDsKdmVjdG9yPGludD4gcHJpbWVzOwoKaW50IGlzX3ByaW1lKGludCBwKQp7CiAgICBpbnQgc3EgPSBzcXJ0KHApOwogICAgZm9yIChpbnQgcHMgOiBwcmltZXMpIHsKICAgICAgICBpZihzcSA8IHBzKQogICAgICAgICAgICByZXR1cm4gMTsKICAgICAgICBpZihwICUgcHMgPT0gMCkKICAgICAgICAgICAgcmV0dXJuIDA7CiAgICB9CiAgICByZXR1cm4gMTsKfQoKdm9pZCBwcmltZShpbnQgTikKewogICAgaW50IGsgPSAwOwogICAgY250ICs9IDI7CiAgICBwcmltZXMucHVzaF9iYWNrKDIpOwogICAgcHJpbWVzLnB1c2hfYmFjaygzKTsKICAgIHdoaWxlIChjbnQgPCBOKSB7CiAgICAgICAgaysrOwogICAgICAgIGlmKGlzX3ByaW1lKDYqay0xKSA9PSAxKXsKICAgICAgICAgICAgY250ICsrOwogICAgICAgICAgICBwcmltZXMucHVzaF9iYWNrKDYqay0xKTsKICAgICAgICB9CiAgICAgICAgaWYoaXNfcHJpbWUoNiprKzEpID09IDEpewogICAgICAgICAgICBjbnQgKys7CiAgICAgICAgICAgIHByaW1lcy5wdXNoX2JhY2soNiprKzEpOwogICAgICAgIH0KICAgIH0KICAgIHJldHVybjsKfQoKaW50IG1haW4oKSB7CiAgICBpbnQgYTsKICAgIHNjYW5mKCIlZCIsJmEpOwogICAgc2NhbmYoIiVkIiwgJk4pOwogICAgcHJpbWUoTik7CiAgICBpZihhID09IDEpIHByaW50ZigiJWQiLHByaW1lc1tOLTFdKTsKICAgIGlmKGEgPT0gMCkgZm9yKGludCB4IDogcHJpbWVzKQogICAgICAgIHByaW50ZigiJWQgIix4KTsKICAgIHJldHVybiAwOwp9