#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

const int N = 5;
int C[5][5];

void solve() {
    int N, X;
    cin >> N >> X;
    int m = N % 4;

    vi ans;
    if (m == 0) {
        for (int i : {1, 2, 3, X})ans.push_back(i);
    } else if (m == 1) {
        ans.push_back(X);
    } else if (m == 2) {
        for (int i : {1, X ^ 1}) ans.push_back(i);
    } else {
        for (int i : {1, 2, X ^ 3})ans.push_back(i);
    }

    int n = (m == 0 ? (N - 4) / 4 : N / 4);
    for (int i = 4; i < 100006 && n>0; i += 4) {
        int j = i + 4;
        if (i <= X && X < j)continue;
        n--;
        for (int k = i; k < j; ++k)ans.push_back(k);
    }

    int x = 0;
    each(a, ans) {
        x ^= a;
        cout << a << endl;
    }
    assert(x == X);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}