#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
  {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
  {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
  {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
  #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
  #define dump(...)
  #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

signed main() {
  int m, k; cin >> m >> k;
  int n = 1LL << m;
  if (k == 0) {
    REP (i, n) cout << i << " " << i << " ";
    cout << endl;
  } else if (m <= 2) {
    int n = 1LL << m;
    vector<int> ans(n * 2);
    REP (i, n) ans[2 * i] = ans[2 * i + 1] = i;
    do {
      bool ok = true;
      REP (i, n * 2) {
        int acc = ans[i];
        REPI (j, i + 1, n * 2) {
          acc ^= ans[j];
          if (ans[i] == ans[j]) {
            if (acc != k) ok = false;
          }
        }
      }
      if (ok) {
        REP (i, n * 2) cout << ans[i] << " ";
        cout << endl;
        return 0;
      }
    } while (next_permutation(ALL(ans)));
    cout << -1 << endl;
  } else {
    if (k < n) {
      cout << 0 << " " << k << " " << 0 << " ";
      REPI (i, 1, n) {
        if (i != k) cout << i << " ";
      }
      cout << k << " ";
      for (int i = n - 1; i >= 1; i--) {
        if (i != k) cout << i << " ";
      }
      cout << endl;
    } else {
      cout << -1 << endl;
    }
  }
}


Measured memory_bytes: 1792