#include <bits/stdc++.h>
using namespace std;

template <class T> int sz(T&& a) { return int(size(forward<T>(a))); }

template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;

using ll = int64_t;
using vi = vc<int>;

template <class F>
struct ycr {
	F f;
	
	template <class T>
	explicit ycr(T&& f_) : f(forward<T>(f_)) {}

	template <class... Args>
	decltype(auto) operator()(Args&&... args) {
		return f(ref(*this), forward<Args>(args)...);
	}
};
template <class F>
decltype(auto) yc(F&& f) {
	return ycr<decay_t<F>>(forward<F>(f));
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cout << fixed << setprecision(20);

	int a, b; cin >> a >> b;

	auto parent = [&](int i) -> int {
		assert(i > 1);
		return i/2;
	};
	auto depth = [&](int i) -> int {
		int d = 0;
		while (i > 1) {
			i = parent(i);
			d++;
		}
		return d;
	};

	set<int> ans({a, b});
	auto join_other_ch = [&](int i) -> void {
		assert(i >= 1);
		ans.insert(i^1);
	};

	if (depth(a) > depth(b)) swap(a, b);
	while (depth(a) < depth(b)) {
		join_other_ch(b);
		b = parent(b);
	}

	if (a == b) {
		cout << -1 << '\n';
		exit(0);
	}

	while (a != b) {
		if ((a^1) != b) {
			join_other_ch(a);
			join_other_ch(b);
		}
		a = parent(a);
		b = parent(b);
		assert(depth(a) == depth(b));
	}
	//cerr << "lca=" << a << endl;
	while (a > 1) {
		if (a == 1) break;
		join_other_ch(a);
		a = parent(a);
	}

	vector<int> out;
	for (int i : ans) out.push_back(i);
	int n = int(out.size());
	//cout << n << '\n';
	for (int i = 0; i < n; i++) {
		cout << out[i] << " \n"[i+1==n];
	}
}