#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int MAXN=15487469;
const int MAXP=1000200;
bool a[MAXN+10]={0};
int p[MAXP],N,M,P=0,Need;
/* 有り難う、COGS！
   然様なら、COGS！*/
inline int Min(int a,int b){return a<b?a:b;}

void makeprime()
{
	int i,j;
	for(i=2;i<=Need;i++)
	{
		if(!(a[i])) p[++P]=i; j=1;
		for(;(j<=P)&&(i*p[j]<=Need);j++)
		{
			a[i*p[j]]=1;
			if(!(i%p[j])) break;
		}
	}
}

int main()
{
	freopen("tinkle.in","r",stdin);
	freopen("tinkle.out","w",stdout);
	scanf("%d %d\n",&N,&M);
	Need=Min(N*20,MAXN);
	makeprime();
	for(int i=N-M;i<=N-1;i++) printf("%d ",p[i]);
	for(int i=N+1;i<=N+M;i++) printf("%d ",p[i]);
	return 0;
}