// 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');
}

void one(int N) {
	int i, w, x;
	
	w = N/4*4, x = N % 4;
	if (x == 0) w -= 4, x = 4;
	if (x >= 3) for (i = 0; i < w; i++) out(i+8);
	else        for (i = 0; i < w; i++) out(i+6);
	if (x == 1) out(1);
	else if (x == 2) out(2), out(3);
	else if (x == 3) out(2), out(4), out(7);
	else out(1), out(2), out(4), out(6);
}

int a[100010];
int main()
{
	int i, N, X, w;
	
	N = in(), X = in();
	if (N == 1) { out(X); return 0; }
	if (X == 1) { one(N); return 0; }
	if (N == 2) { out(1), out(X & 1? X-1: X+1); return 0; }
	if (N == 3) { 
		if (X & 1) out(X-1), out(X+1), out(X+2);
		else       out(X+1), out(X+2), out(X+3);
		return 0;
	}

	w = 0;
	if (X & 1) {
		for (i = 2; i < X-1; i++) {
			a[w++] = i;
			if (w == N-2) {
				if ((i & 1) == 0) w--;
				goto nx;
			}
		}
		for (i = N-(1-(N&1)); i >= X+1; i--) a[w++] = i;
	} else {
		for (i = 2; i < X; i++) {
			a[w++] = i;
			if (w == N-2) {
				if ((i & 1) == 0) w--;
				goto nx;
			}
		}
		for (i = N-(1-(N&1)); i >= X+2; i--) a[w++] = i;
	}
nx:	if (w < N-3) a[w++] = 100002, a[w++] = 100003;

	if (N-w == 2) {
		a[w++] = 1;
		if ((w / 2) & 1) a[w++] = X;
		else a[w++] = X & 1? X-1: X+1;
	} else {
		if (N-w == 3) a[w++] = 100004, a[w++] = 100005;
		if ((w / 2) & 1) a[w++] = X & 1? X-1: X+1;
		else a[w++] = X;
	}
	
	for (i = 0; i < w; i++) out(a[i]);
	return 0;
}