#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;

bool dame[1 << 17];
void solve() {
	int n, x; cin >> n >> x;
	vector<int> ans;
	if (n % 4 == 1) {
		ans.push_back(x);
		dame[x / 4] = true;
		int cur = 4;
		rep(j, n / 4) {
			if (dame[cur/4]) {
				j--; cur += 4; continue;
			}
			rep(k, 4) {
				ans.push_back(cur + k);
			}
			cur += 4;
		}
	}
	else if (n % 4 == 2) {
		if (x == 1) {
			ans.push_back(2); ans.push_back(3);
		}
		else {
			ans.push_back(1); ans.push_back(x ^ 1);
			dame[(x ^ 1) / 4] = true;
		}
		int cur = 4;
		rep(j, n / 4) {
			if (dame[cur / 4]) {
				j--; cur += 4; continue;
			}
			rep(k, 4) {
				ans.push_back(cur + k);
			}
			cur += 4;
		}
	}
	else if (n % 4 == 3) {
		if (x == 3) {
			ans.push_back(2); ans.push_back(4);
			ans.push_back(5); dame[1] = true;
		}
		else if (x == 1) {
			ans.push_back(2); ans.push_back(5);
			ans.push_back(6); dame[1] = true;
		}
		else if (x == 2) {
			ans.push_back(1); ans.push_back(5);
			ans.push_back(6); dame[1] = true;
		}
		else {
			ans.push_back(1); ans.push_back(2);
			ans.push_back(x ^ 3); dame[(x ^ 3) / 4] = true;
		}
		int cur = 4;
		rep(j, n / 4) {
			if (dame[cur / 4]) {
				j--; cur += 4; continue;
			}
			rep(k, 4) {
				ans.push_back(cur + k);
			}
			cur += 4;
		}
	}
	else {
		if (x == 1) {
			ans.push_back(1); ans.push_back(2);
			ans.push_back(4); ans.push_back(6);
			dame[1] = true;
		}
		else if (x == 2) {
			ans.push_back(1); ans.push_back(2);
			ans.push_back(4); ans.push_back(5);
			dame[1] = true;
		}
		else if (x == 3) {
			ans.push_back(1); ans.push_back(3);
			ans.push_back(4); ans.push_back(5);
			dame[1] = true;
		}
		else {
			rep1(j, 3)ans.push_back(j);
			ans.push_back(x); dame[x / 4] = true;
		}
		int cur = 4;
		rep(j, n / 4) {
			if (dame[cur / 4]) {
				j--; cur += 4; continue;
			}
			rep(k, 4) {
				ans.push_back(cur + k);
			}
			cur += 4;
		}
	}
	//cout << ans.back() << endl; return;
	rep(i, ans.size()) {
		cout << ans[i] << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	solve();
	//cout << "finish" << endl;
	//stop
	return 0;
}