#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<int>f(long long n) {
	vector<int>ret;
	rep(i, 61) {
		if (1 == n % 2) {
			ret.push_back(i);
		}
		n /= 2;
	}
	reverse(all(ret));
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	long long x, y; cin >> x >> y;
	if (x == y) {
		cout << 0 << endl;
		return 0;
	}
	if (0 == y) {
		cout << -1 << endl;
		return 0;
	}
	vector<int>ans;
	ans.push_back(n);
	auto v = f(y);
	rep(i, v.size() - 1) {
		ans.push_back(abs(v[i] - v[i + 1]));
	}
	for (auto e : ans) {
		if (e<0 || e>n) {
			cout << -1 << endl;
			return 0;
		}
	}
	cout << ans.size() << endl;
	for (auto e : ans)cout << e << " ";
	cout << endl;
	return 0;
}