#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,int> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;

string f(ll x){
    string res="";
    while(x>0){
        res+=to_string(x%2);
        x/=2;
    }
    reverse(res.begin(),res.end());
    return res;
}

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

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



    vector<ll> ans;
    ans.push_back(N);

    ll t=1;
    vector<ll> bit;
    for(int i=0;i<N;i++){
        if(Y>>i&1){
            bit.push_back(i);
        }
    }

    vector<int> a;
    for(int i=0;i+1<bit.size();i++){
        //[a[i],a[i+1])の長さを求める
        a.push_back(bit[i+1]-bit[i]);
    }
    

    reverse(a.begin(),a.end());
    for(int v:a){
        ans.push_back(v);
    }

    cout<<ans.size()<<endl;
    for(int v:ans){
        cout<<v<<' ';
    }

}