#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstdlib>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <iomanip>

#define SWS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define ppb pop_back
#define ft first
#define sd second
#define read freopen("input.txt", "r", stdin)
#define write freopen("output.txt", "w", stdout)
#define files read; write

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int Z = (int)3e3 + 228;
const int N = (int)3e5 + 228;
const int INF = (int)1e9 + 228;
const int MOD = (int)1e9 + 7;

int main()
{
	SWS;
	//files;
	int k, y;
	cin >> k >> y;
	vector<int> bits(30, 0);
	for (int i = 0; i < 30; i++)
		bits[i] = ((y >> i) & 1);
	vector<int> pos0;
	int cnt0;
	for (int i = 0; i < 30; i++)
		if (!bits[i])
		{
			cnt0++;
			pos0.pb(i);
		}
	//cout << cnt0 << ' ' << pos0.size() << endl;
	vector<int> ans;
	for (int mask = 0; mask < (1 << cnt0); mask++)
	{
		if (ans.size() == k) break;
		int val = 0;
		for (int i = 0; i < 31; i++)
			if ((mask >> i) & 1) val += (1 << pos0[i]);
		val |= y;
		ans.pb(val);
	}
	if (ans.size() != k)
		cout << -1;
	else
		for (int i : ans)
			cout << i << ' ';
	return 0;
}