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

using ll = long long;

int main() {
    int N; ll X, Y; 
    cin >> N >> X >> Y;

    if (X == Y) {
        cout << 0 << endl;
        cout << endl;
        return 0;
    }
    if (Y%2 == 0) {
        cout << -1 << endl;
        return 0;
    }

    vector<int> A;
    A.push_back(N);

    vector<int> bit;
    for (int i = 0; i < N; i++) {
        if (Y>>i&1) bit.push_back(i);
    }
    
    vector<int> Ld;
    for (int i = 0; i < (int)bit.size()-1; i++) {
        Ld.push_back(bit[i+1] - bit[i]);
    }
    reverse(Ld.begin(), Ld.end());

    A.insert(A.end(), Ld.begin(), Ld.end());
    
    int K = (int)A.size();
    cout << K << endl;
    for (int a : A) cout << a << " ";
    cout << endl;
}