#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class T, class V>
typename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {
    t = v;
}
template<class T, class V>
typename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){
    for (auto &e : t) fill(e, v);
}

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }

#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }





int M, K;

void solve() {
    if (M == 0) {
        if (K != 0) cout << -1 << endl;
        else cout << "0 0" << endl;
        return;
    }
    if (M == 1) {
        if (K != 0) cout << -1 << endl;
        else cout << "0 0 1 1" << endl;
        return;
    }

    if (K >= (1<<M)) {
        cout << -1 << endl;
        return;
    }
    if (K == 0) {
        for (int bit = 0; bit < (1<<M); ++bit) {
            cout << bit << " ";
        }
        for (int bit = (1<<M)-1; bit >= 0; --bit) {
            cout << bit << " ";
        }
        cout << endl;
        return;
    }
                

    using pint = pair<int,int>;
    vector<pint> v;
    for (int bit = 0; bit < (1<<M); ++bit) {
        v.push_back(pint(min(bit, bit^K), max(bit, bit^K)));
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());

    //COUT(v);

    for (int i = 0; i < v.size(); i += 2) {
        cout << v[i].first <<  " " << v[i].second << " "
             << v[i+1].first << " " << v[i+1].second << " "
             << v[i].second << " " << v[i].first << " "
             << v[i+1].second << " " << v[i+1].first << " ";
    }
    cout << endl;
}

int main() {
    while (cin >> M >> K) {
        solve();
    }
}


Measured memory_bytes: 2932