//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr usize operator"" _z(unsigned long long x) noexcept {
  return static_cast<usize>(x);
}

class rep {
  const usize f, l;

public:
  class itr {
    friend rep;
    usize i;
    constexpr itr(const usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr rep(const usize first, const usize last) noexcept
      : f(first), l(last) {}
  constexpr itr begin() const noexcept { return itr(f); }
  constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
  const usize f, l;

public:
  class itr {
    friend revrep;
    usize i;
    constexpr itr(usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
  constexpr itr begin() const noexcept { return itr(l); }
  constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
  return a < b ? b - a : a - b;
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#include <algorithm>
#include <iostream>
#include <utility>

namespace n91 {

void main_() {
  const usize n = scan<usize>();
  const usize x = scan<usize>();

  std::vector<usize> a;
  usize i = 4_z;
  for (; n - a.size() > 4_z; i += 4_z) {
    if (i <= x && x < i + 4_z) {
      continue;
    }
    a.push_back(i);
    a.push_back(i + 1_z);
    a.push_back(i + 2_z);
    a.push_back(i + 3_z);
  }
  const usize rem = n - a.size();
  if (rem == 1_z) {
    a.push_back(x);
  } else if (rem == 2_z) {
    if (x == 1_z) {
      a.push_back(2_z);
      a.push_back(3_z);
    } else {
      a.push_back(x ^ 1_z);
      a.push_back(1_z);
    }
  } else if (rem == 3_z) {
    if (x == 1_z) {
      a.push_back(i + 1_z);
      a.push_back(i + 2_z);
      a.push_back(2_z);
    } else if (x == 2_z) {
      a.push_back(i + 1_z);
      a.push_back(i + 2_z);
      a.push_back(1_z);
    } else if (x == 3_z) {
      a.push_back(i + 3_z);
      a.push_back(i + 2_z);
      a.push_back(2_z);
    } else {
      a.push_back(x ^ 1_z);
      a.push_back(2_z);
      a.push_back(3_z);
    }
  } else {
    if (x == 1_z) {
      a.push_back(i);
      a.push_back(i + 2_z);
      a.push_back(1_z);
      a.push_back(2_z);
    } else if (x == 2_z) {
      a.push_back(i);
      a.push_back(i + 1_z);
      a.push_back(1_z);
      a.push_back(2_z);
    } else if (x == 3_z) {
      a.push_back(i);
      a.push_back(i + 1_z);
      a.push_back(1_z);
      a.push_back(3_z);
    } else {
      a.push_back(x);
      a.push_back(1_z);
      a.push_back(2_z);
      a.push_back(3_z);
    }
  }

  for (const auto e : a) {
    std::cout << e << std::endl;
  }
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}