#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<end

int main(void) {
	int n,x;
	cin>>n>>x;
	int n1 = n % 4;
	if(n1==0)n1+=4;
	n -= n1;
	vector<int> v;
	v.pb(1);
	if(x==1){
		v.pb(2);
		v.pb(3);
		v.pb(4);
		v.pb(7);
	}
	vector<int> v1;
	for(int i = 2; i < 100006; i+=4){
		if(i<=x&&x<i+4){
			for(int j = i; j < i+4; j++){
				v.pb(j);
			}			
		}
		else{
			if(x==1&&i<10)continue;
			for(int j = i; j < i+4; j++){
				if(n>0)v1.pb(j);
				n--;
			}
		}
	}
	do{
		int a = 0;
		for(int i = 0; i < n1; i++){
			a ^= v[i];
		}
		if(a==x){
			for(int i = 0; i < n1; i++){
				v1.pb(v[i]);
			}			
			break;
		}
	}while(next_permutation(all(v)));
	for(int i = 0; i < v1.sz; i++){
		cout << v1[i] << endl;
	}
	return 0;
}