#include #include #include #include #include #include #include #include #include #include #include #include #include #include #pragma region using namespace std; #define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++) #define rep(i,n) FOR(i,0LL,n) #define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--) #define rrep(i,n) RFOR(i,0LL,n) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x) #define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end()) #define pb push_back typedef long long int ll; typedef vector vll; typedef vector vvll; typedef pair pll; typedef vector vpll; typedef vector vs; typedef map MAP; const ll inf = 1LL << 61; const ll mod = 1000000007LL; //const ll mod = 998244353LL; ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf; string s; ll dx[9] = { 0,1,0,-1,0,1,1,-1,-1 }, dy[9] = { 0,0,1,0,-1,1,-1,1,-1 }; #define endl '\n' #pragma endregion #define MAX 222222 int main(void) { ios::sync_with_stdio(false); cin.tie(0); ll x; cin >> n >> x; vll v; if (n % 4 == 1) { v.pb(x); for (ll i = 2; i <= 1e5 + 4; i += 2) { if (i == x || i == (x ^ 1)) continue; if (v.size() == n) break; v.pb(i); v.pb(i ^ 1); } } else if (n % 4 == 2) { v.pb(1); v.pb(x ^ 1); for (ll i = 2; i <= 1e5 + 4; i += 2) { if (i == x || i == (x ^ 1)) continue; if (v.size() == n) break; v.pb(i); v.pb(i ^ 1); } } else if (n % 4 == 3) { v.pb(x ^ 1); for (ll i = 2; i <= 1e5 + 4; i += 2) { if (i == x || i == (x ^ 1)) continue; if (v.size() == n) break; v.pb(i); v.pb(i ^ 1); } } else if (n % 4 == 0) { v.pb(1); v.pb(x); for (ll i = 2; i <= 1e5 + 4; i += 2) { if (i == x || i == (x ^ 1)) continue; if (v.size() == n) break; v.pb(i); v.pb(i ^ 1); } } rep(i, v.size()) cout << v[i] << endl; return 0; }