#include<cstdio>
#include<cstring>
using namespace std;
int n,m,i,p,N;
bool f[15500001];
int prime[5000001];
int main()
{
	freopen("tinkle.in","r",stdin);
	freopen("tinkle.out","w",stdout);
	scanf("%d%d",&n,&m);
	N=15500000;
	p=0;
		memset(f,true,sizeof(f));
	for (i=2;i<=N;i++)
		if (f[i]){
			prime[++p]=i;
			for (int j=i+i;j<=N;j+=i){
					f[j]=false;
			}
		}
	for (i=n-m;i<=n+m;i++)
		if (i!=n)
		printf("%d ",prime[i]);
	return 0;
}