#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int popcount(long long n) {
	n = (n & 0x5555555555555555) + (n >> 1 & 0x5555555555555555);
	n = (n & 0x3333333333333333) + (n >> 2 & 0x3333333333333333);
	n = (n & 0x0f0f0f0f0f0f0f0f) + (n >> 4 & 0x0f0f0f0f0f0f0f0f);
	n = (n & 0x00ff00ff00ff00ff) + (n >> 8 & 0x00ff00ff00ff00ff);
	n = (n & 0x0000ffff0000ffff) + (n >> 16 & 0x0000ffff0000ffff);
	n = (n & 0x00000000ffffffff) + (n >> 32 & 0x00000000ffffffff);
	return n;
}
#define output(v,add)rep(_,v.size())cout << v[_] + add <<" ";cout<< endl;
#define debug(v) output(v,0)
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, x; cin >> n >> x;
	vector<int>v;
	set<int>st;
	if (1 == x) {
		st.insert(0);
		st.insert(1);
		v = { 1,2,3,4,7 };
	}
	else {
		int a = (x - 2) / 4;
		st.insert(a);
		v = { 1,4 * a + 2,4 * a + 3,4 * a + 4,4 * a + 5 };
	}
	int c = n % 4;
	vector<int>ans;
	rep(i, 1 << 5) {
		if (c != popcount(i))continue;
		int _x = 0;
		vector<int>a;
		rep(j, 5) {
			if (1 & (i >> j)) {
				_x ^= v[j];
				a.push_back(v[j]);
			}
		}
		if (x == _x) {
			ans = a;
			break;
		}
	}
	for (int i = 0;;++i) {
		if (st.count(i))continue;
		if (ans.size() == n)break;
		rep2(j, 2, 6)ans.push_back(4 * i + j);
	}
	sort(all(ans));
	rep(i,ans.size()) {
		cout << ans[i] << endl;
	}
	return 0;
}