#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N, X;
  cin >> N >> X;


  vector< int > unsed;
  if(X <= 3) {
    unsed.emplace_back(1);
    unsed.emplace_back(2);
    unsed.emplace_back(3);
  } else {
    unsed.emplace_back(1);
    unsed.emplace_back(2);
    unsed.emplace_back(3);
    unsed.emplace_back(X / 4 * 4);
    unsed.emplace_back(X / 4 * 4 + 1);
    unsed.emplace_back(X / 4 * 4 + 2);
    unsed.emplace_back(X / 4 * 4 + 3);
  }


  vector< int > ans;
  int base = 4;
  while(N >= 5) {
    if(base <= X && X <= base + 3) {

    } else {
      ans.emplace_back(base);
      ans.emplace_back(base + 1);
      ans.emplace_back(base + 2);
      ans.emplace_back(base + 3);
      N -= 4;
    }
    base += 4;
  }


  while(base <= 100005 && unsed.size() <= 20) {
    while(unsed.back() >= base) ++base;
    if(base > 100005) break;
    unsed.emplace_back(base);
  }


  sort(begin(unsed), end(unsed));
  unsed.erase(unique(begin(unsed), end(unsed)), end(unsed));


  while(base <= 100005 && unsed.size() <= 20) {
    while(unsed.back() >= base) ++base;
    if(base > 100005) break;
    unsed.emplace_back(base);
  }


  sort(begin(unsed), end(unsed));
  unsed.erase(unique(begin(unsed), end(unsed)), end(unsed));


  for(int i = 0; i < (1 << unsed.size()); i++) {
    if(__builtin_popcount(i) != N) continue;
    int ret = 0;
    for(int j = 0; j < unsed.size(); j++) {
      if((i >> j) & 1) ret ^= unsed[j];
    }
    if(ret == X) {
      for(int j = 0; j < unsed.size(); j++) {
        if((i >> j) & 1) ans.emplace_back(unsed[j]);
      }
      break;
    }
  }
  for(auto &p : ans) cout << p << "\n";
}