using System;

public class Program
{
    private int M;
    private int K;
    private int L;

    public void Solve()
    {
        var sc = new Scanner();
        M = sc.NextInt();
        K = sc.NextInt();
        int L = 1 << M;
        /*
         * 0 ~ 2^M -1 xor 0 (M>2) 
         */

        if (M == 0)
        {
            // 0だけ
            // 0 0

            Console.WriteLine(K == 0 ? "0 0" : "-1");
        }
        else if (M == 1)
        {
            // 0,1
            Console.WriteLine(K == 0 ? "0 1 1 0" : "-1");
        }
        else
        {
            if (K == 0)
            {
                var ans = new int[2 * L];
                for (int i = 0; i < L; i++)
                {
                    ans[i] = i;
                    ans[2 * L - i - 1] = i;
                }

                Console.WriteLine(string.Join(" ", ans));
            }
            else
            {
                if (K < L)
                {
                    var ans = new int[2 * L];
                    int index = 0;
                    int last = 2 * L - 2;
                    for (int i = 0; i < L; i++)
                    {
                        if (i == K) continue;
                        ans[index++] = i;
                        ans[last--] = i;
                    }

                    ans[L - 1] = K;
                    ans[2 * L - 1] = K;
                    Console.WriteLine(string.Join(" ", ans));
                }
                else
                {
                    Console.WriteLine(-1);
                }
            }
        }
    }

    public static void Main(string[] args)
    {
        new Program().Solve();
    }
}

class UnionFind
{
    private int[] Par, Rank;

    public UnionFind(int max)
    {
        Par = new int[max];
        Rank = new int[max];
        for (int i = 0; i < max; i++)
        {
            Par[i] = i;
        }
    }

    private int Find(int n)
    {
        if (Par[n] == n)
        {
            return n;
        }
        else
        {
            return Find(Par[n]);
        }
    }

    public bool Same(int a, int b)
    {
        return Find(a) == Find(b);
    }

    public void Union(int a, int b)
    {
        a = Find(a);
        b = Find(b);
        if (a == b) return;
        if (Rank[a] < Rank[b])
        {
            Par[a] = b;
        }
        else
        {
            Par[b] = a;
            if (Rank[a] == Rank[b]) Rank[a]++;
        }
    }
}

class Scanner
{
    public Scanner()
    {
        _pos = 0;
        _line = new string[0];
    }

    const char Separator = ' ';
    private int _pos;
    private string[] _line;

    #region スペース区切りで取得

    public string Next()
    {
        if (_pos >= _line.Length)
        {
            _line = Console.ReadLine().Split(Separator);
            _pos = 0;
        }

        return _line[_pos++];
    }

    public int NextInt()
    {
        return int.Parse(Next());
    }

    public long NextLong()
    {
        return long.Parse(Next());
    }

    public double NextDouble()
    {
        return double.Parse(Next());
    }

    #endregion

    #region 型変換

    private int[] ToIntArray(string[] array)
    {
        var result = new int[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = int.Parse(array[i]);
        }

        return result;
    }

    private long[] ToLongArray(string[] array)
    {
        var result = new long[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = long.Parse(array[i]);
        }

        return result;
    }

    private double[] ToDoubleArray(string[] array)
    {
        var result = new double[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = double.Parse(array[i]);
        }

        return result;
    }

    #endregion

    #region 配列取得

    public string[] Array()
    {
        if (_pos >= _line.Length)
            _line = Console.ReadLine().Split(Separator);

        _pos = _line.Length;
        return _line;
    }

    public int[] IntArray()
    {
        return ToIntArray(Array());
    }

    public long[] LongArray()
    {
        return ToLongArray(Array());
    }

    public double[] DoubleArray()
    {
        return ToDoubleArray(Array());
    }

    #endregion
}

Measured memory_bytes: 27224