#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <set>
#include <queue>
#include <algorithm>
#define MAXN 0x7fffffff
using namespace std;
int a[1100000],b,c,d,l,m,n;
bool bo[15500000];
int main(void)
{
    freopen("tinkle.in","r",stdin);
    freopen("tinkle.out","w",stdout);
	for (b=2;b<15500000;b++)
		if (bo[b]==false)
		{
			for (c=b;c<15500000;c+=b) bo[c]=true;
			a[n]=b;
			n++;
		}
	scanf("%d%d",&b,&c);
	if (b-1<c)
	{
		for (d=0;d<=c*2;c++) 
			if (d!=b-1) printf("%d ",a[d]);
	}
		else 
		{
			for (d=b-c-1;d<b+c;d++)
				if (d!=b-1) printf("%d ",a[d]);
		}
	fclose(stdin);
    fclose(stdout);
    return 0;
}