#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

void print_(deque<int> &ans) {
  int n = ans.size();
  rep (i, n) {
    printf("%d%c", ans[i], " \n"[i == n-1]);
  }
  exit(0);
}

int main() {
  int m, k;
  scan(m, k);
  int n = 1;
  rep (i, m) {
    n *= 2;
  }
  if (k >= n) {
    print(-1);
    return 0;
  }
  if (m == 1 && k == 1) {
    print(-1);
    return 0;
  }

  deque<int> ans;
  if (k == 0) {
    rep (i, n) {
      ans.push_back(i);
    }
    for (int i = n-1; i >= 0; --i) {
      ans.push_back(i);
    }
    print_(ans);
  }

  vi s2;
  int bp = __builtin_popcount(k);
  if (bp == 1) {
    int bit = -1;
    rep (i, m) {
      if (((k >> i) & 1) == 0) {
        bit = i;
        break;
      }
    }
    assert (bit >= 0);
    s2 = {(1 << bit), (1 << bit) + k};
  } else if (2 <= bp && bp <= m) {
    rep (i, m) {
      if (((k >> i) & 1) == 1) {
        s2.push_back(1 << i);
      }
    }
  } else {
    assert (false);
  }

  vi vs3(n, 1);
  vs3[k] = 0;
  for (auto es2 : s2) {
    vs3[es2] = 0;
  }
  vi s3;
  rep (i, n) {
    if (vs3[i] == 1) {
      s3.push_back(i);
    }
  }
  //debug(s2);
  //debug(s3)

  for (auto e : s3) {
    ans.push_back(e);
  }
  ans.push_back(k);
  reverse(all(s3));
  for (auto e : s3) {
    ans.push_back(e);
  }
  for (auto e : s2) {
    ans.push_back(e);
  }
  ans.push_back(k);
  reverse(all(s2));
  for (auto e : s2) {
    ans.push_back(e);
  }
  print_(ans);

  return 0;
}


Measured memory_bytes: 3960