#include<cstdio>
using namespace std;
int a[205];
int pri[100000];
int head=2;
bool prim(int x)
{
	for(int i=2;i<=x;i++)
	{
		if(x%i==0) return false;
	}
	return true;
}
void prime()
{
	for(int i=3;i<=1001;i++)
	{
		if(i%2==0) continue;
		else
		{
			if(prim(i)==true)
			{
				pri[head]=i;
				head++;
			}
		}
	}
}
int main()
{
	freopen("tinkle.in","r",stdin);
	freopen("tinkle.out","w",stdout);
	int n,m;
	scanf("%d%d",&n,&m);
	pri[1]=2;
	prime();
	int left=n-m,righ=n+m;
	printf("%d",pri[left]);
	for(int i=left+1;i<=righ&&i!=n;i++) printf(" %d",pri[i]);
	return 0;
}