#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n, x; cin >> n >> x;
  vector<int> ans;
  if (x == 1) {
    for (int i = 8; i + 3 <= 100005; i += 4) {
      if (n > 4) {
        ans.emplace_back(i);
        ans.emplace_back(i + 1);
        ans.emplace_back(i + 2);
        ans.emplace_back(i + 3);
        n -= 4;
      }
    }
    vector<int> puzzle{1, 2, 3, 4, 7};
    int comb = (1 << n) - 1;
    while (comb < (1 << 5)) {
      int tmp = 0;
      REP(i, 5) {
        if (comb >> i & 1) tmp ^= puzzle[i];
      }
      if (tmp == x) {
        REP(i, 5) {
          if (comb >> i & 1) ans.emplace_back(puzzle[i]);
        }
        break;
      }
      int x = comb & -comb, y = comb + x;
      comb = (((comb & ~y) / x) >> 1) | y;
    }
  } else {
    for (int i = 2; i + 3 <= 100005; i += 4) {
      if (i <= x && x <= i + 3) continue;
      if (n > 4) {
        ans.emplace_back(i);
        ans.emplace_back(i + 1);
        ans.emplace_back(i + 2);
        ans.emplace_back(i + 3);
        n -= 4;
      }
    }
    int a = x / 4;
    if (x % 4 == 0 || x % 4 == 1) --a;
    vector<int> puzzle{1};
    FOR(i, 2, 6) puzzle.emplace_back(4 * a + i);
    int comb = (1 << n) - 1;
    while (comb < (1 << 5)) {
      int tmp = 0;
      REP(i, 5) {
        if (comb >> i & 1) tmp ^= puzzle[i];
      }
      if (tmp == x) {
        REP(i, 5) {
          if (comb >> i & 1) ans.emplace_back(puzzle[i]);
        }
        break;
      }
      int x = comb & -comb, y = comb + x;
      comb = (((comb & ~y) / x) >> 1) | y;
    }
  }
  REP(i, ans.size()) cout << ans[i] << '\n';
  return 0;
}