#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <forward_list>
#include <random>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif

#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'

using namespace std;

typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
typedef pair< int, P > iP;
typedef pair< P, P > PP;

static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 100005;

const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};

vector< int > Div( int n ) {
    vector< int > ret;
    for( int i = 1; i * i <= n; ++i ) {
        if( n % i == 0 ) {
            ret.pb( i );

            if( i * i != n ) ret.pb( n / i );
        }
    }
    sort( all( ret ) );
    return ret;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    unsigned int n, x;
    bool used[SIZE + 1] = {};
    cin >> n >> x;

    if( n == 2 ) {
        cout << 1 << endl;
        for( int i = 2; i <= SIZE; ++i ) {
            if( ( 1 ^ i ) == x ) {
                cout << i << endl;
                return 0;

             }
        }
    }

    unsigned int bi = 1;
    while( bi < x ) bi <<= 1, ++bi;
    bi >>= 1;

    unsigned int tmp_1 = (~x) & bi;
    unsigned int tmp_2;
    if( tmp_1 & 1 ) tmp_2 = tmp_1 - 1;
    else tmp_2 = tmp_1 + 1;

    if( tmp_2 == 0 ) tmp_2 = x;

    if( n & 1 ) {
        unsigned int res = 0;
        bool flg = false;
        for( unsigned int i = 1; i + 1 <= SIZE && n > 1; i += 2 ) {
            if( i != tmp_1 && i != tmp_2 && 
                    i + 1 != tmp_1 && i + 1 != tmp_2 ) {
                if( !flg ) {
                    res = i ^ ( i + 1 );
                    flg = true;

                } else {
                    res = ( i ^ ( i + 1 ) ) ^ res;

                }
                used[i] = used[i + 1] = true;
                cout << i << endl;
                cout << i + 1 << endl;
                n -= 2;

            }
        }
        for( int i = 1; i <= SIZE; ++i ) {
            if( !used[i] && ( i ^ res ) == x ) {
                cout << i << endl;
                return 0;

            }
        }
    } else {
        unsigned int res = 0;
        bool flg = false;
        for( unsigned int i = 2; i + 1 <= SIZE && n > 2; i += 2 ) {
            if( i != tmp_1 && i != tmp_2 && i != x &&
                i + 1 != tmp_1 && i + 1 != tmp_2 && i + 1 != x ) {
                if( !flg ) {
                    res = i ^ ( i + 1 );
                    flg = true;

                } else {
                    res ^= i ^ ( i + 1 );

                }
                used[i] = used[i + 1] = true;
                cout << i << endl;
                cout << i + 1 << endl;
                n -= 2;

            }
        }

        res ^= 1;
        cout << 1 << endl;
        
        for( int i = 1; i <= SIZE; ++i ) {
            if( !used[i] && ( res ^ i ) == x ) {
                cout << i << endl;

            }
        }
    }

    return 0;
}