// yukicoder 862 XORでX
// 2019.9.11 bal4u

#include <stdio.h>

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void out(int n) { // 非負整数の表示（出力）
	int i; char b[20];
	i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
	while (i--) pc(b[i]);
	pc('\n');
}

#define MIN(a,b)  ((a)<=(b)?(a):(b))
int one[5][5] = {{0},{1},{2,3},{2,4,7},{1,2,4,6}};
int st[2][2] = {{4,4},{6,8}};

int main()
{
	int i, j, k, x, w;
	int N, Nr, Nq;
	int X, Xr, Xq;
	
	N = in(), X = in();
	if (N == 1) { out(X); return 0; }
	
	Nr = (N>>2)<<2, Nq = N & 3; if (Nq == 0) Nr -= 4, Nq = 4;
	Xr = (X>>2)<<2, Xq = X & 3;
	
	w = 0;
	k = X == 1? Nr: MIN(Xr, Nr); for (i = st[X == 1][Nq >= 3]; i < k; i++) out(i), w++;
	if (Nr != Xr) {
		if (i == Xr) i += 4;
		while (w < Nr) out(i++), w++;
	}

	if (X == 1) { for (i = 0; one[Nq][i]; i++) out(one[Nq][i]); }
	else {
		if (N-w > 4) {
			out(2), out(3);
			if (Xq <= 1) out(Xr+2), out(Xr+3);
			else         out(Xr), out(Xr+1);
			w += 4;
		}
		if (Nq == 1) out(X);
		else if (Nq == 2) out(1), out(X & 1? X-1: X+1);
		else if (Nq == 3) out(100004), out(100005), out(X & 1? X-1: X+1);
		else out(100004), out(100005), out(1), out(X);
	}
	return 0;
}