#include <bits/stdc++.h>
#define herta return 0;
using namespace std;
int p[1000010];
int v[1000010];
int m = 0;
int N,M;
void primes(int n)
{
	memset(v, 0, sizeof(v));
	for(int i = 2; i <= n; ++i)
	{
		if(!v[i]) v[i] = i, p[++m] = i;
		for(int j = 1; j <= m; ++j)
		{
			if(v[i] < p[j]) break;
			if(i * p[j] > n) break;
			v[i * p[j]] = p[j];
		}
	}
}
int main() {
	freopen("tinkle.in", "r", stdin);
	freopen("tinkle.out", "w", stdout);
	primes(1000000);
	cin >> N >> M;
	for(int i = N - M;i < N;i++)
	{
		cout << p[i] << " ";
	}
	for(int i = N + 1;i <= N + M;i++)
	{
		cout << p[i] << " ";
	}
	herta
}