#include<iostream>
using namespace std;

main(){
  int K,X,s,e,max_x = 1000000, min_x = -1000000;
  cin>>K>>X;
  if(X-K+1>min_x) s = X-K+1;
  else s = min_x;
  if(X+K>max_x) e=max_x;
  else e = X+K;
  for(int i=s;i<e;i++){
    cout<<i<<" ";
  }
  return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#define int long long 
const long long inf=1e18;
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long > > vpll;
typedef vector<pair<int, int > > vpii;
#define FORR(x,arr) for(auto& x:arr)
#define ZERO(a) memset(a,0,sizeof(a))





//3111111111111111111111111111111

	bool isprime(int x){
	for(int i = 2;i*i<=x;i++){
		if(x%i == 0)return false;
	}
	return x!=1;
}

	void solve(){


		ini(n);
		vi morty;
		int i = 1;
		while(morty.size()!=55){
			i++;
			int tmp = i*5+1;
			while(!isprime(tmp)){
				i++;
				tmp = i*5+1;
			}
			morty.push_back(tmp);
		}
		FOR(i,0,n){
			cout<<morty[i]<<" ";
		}
		out();








	}	























int32_t main() {
	oneforall
	oneforall
	oneforall
	oneforall
	oneforall
	oneforall
	oneforall
	oneforall
	oneforall
	oneforall
	oneforall
	oneforall
	oneforall 
	oneforall

	solve();
	


	return 0;
}
