#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;

    string S=f(X);
    string T=f(Y);
    while(S.size()<T.size()){
        S="0"+S;
    }
    string tmpT=T;
    while(tmpT.size()<S.size()){
        tmpT="0"+tmpT;
       
    }

    if(S==tmpT){
        cout<<0<<endl;
        return 0;
    }
    // cout<<"S="<<S<<endl;
    // cout<<"T="<<T<<endl;

    if(S!=tmpT && tmpT.back()=='0'){
        //操作不可能
        cout<<-1<<endl;
        return 0;
    }
    // cout<<"S="<<S<<endl;
    // cout<<"T="<<T<<endl;

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

    if(T=="1"){
        cout<<1<<endl;
        cout<<N<<endl;
        return 0;
    }

    int idx=0;
    int l=0;
    int pre=0;
    while(idx<T.size()){
        if(T[idx]=='0'){
            l++;
            pre=0;
        }else{
            //T[idx]=='1'
            // cout<<"l="<<l<<endl;
            ans.push_back(l+1);
            l=0;
            pre=1;
        }
        // cout<<"idx="<<idx<<endl;

        idx++;
    }

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

    return 0;

    
    
}