//#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;


#include "boost/multiprecision/cpp_int.hpp"
#include "boost/multiprecision/cpp_dec_float.hpp"
namespace mp = boost::multiprecision;
typedef mp::cpp_int LL;
typedef mp::number<mp::cpp_dec_float<1024>> DD;// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)

 
typedef long double dd;
//#define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define rrep(i,r,l) for(ll i=r;i>=l;i--)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
template<class T,class S>
inline bool chmax(T &a, S b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T,class S>
inline bool chmin(T &a, S b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

void mod_print(ll k){
    ll P=1000;
    rep(y,1,P){
        ll x=mod(y*k);
        if(x+P>=i_7){
            x-=i_7;
        }
        if(abs(x)<=P){
            cout<<x<<"/"<<y<<endl;
            return;
        }
    }
    cout<<"nun"<<endl;
}
#define all(c) c.begin(),c.end()
//////////////////////////

ll count(ll n){
    ll res=0;
    while(n>0){
        if(n&1)res++;
        n/=2;
    }
    return res;
}
ll n;
vector<ll>cal(ll a,ll b,ll f){
    
    vector<ll>res;
    if(count(f)==n-1){
        res.pb(a);res.pb(b);
        return res;
    }
    rep(i,0,n-1){
        if((f>>i)&1)continue;
        if(((a>>i)&1)!=((b>>i)&1)){
            
            ll ma=0,mb=0;
            rep(j,0,n-1){
                if(i==j){
                    if((a>>i)&1){
                        ma+=1ll<<i;
                    }else{
                        mb+=1ll<<i;
                    }
                }else if((f>>j)&1){
                    if((a>>j)&1){
                        ma+=1ll<<j;
                        mb+=1ll<<j;
                    }
                }
            }
            
            f+=1ll<<i;
            if(abs(count(a)-count(ma))%2==0){
                rep(j,0,n-1){
                    if(!((f>>j)&1)){
                        ma+=1ll<<j;
                        mb+=1ll<<j;
                        break;
                    }
                }
            }
            res=cal(a,ma,f);
            vector<ll>v2=cal(mb,b,f);
            res.insert(res.end(),all(v2));
            return res;
        }
    }
    res.pb(4/0);
    return res;
}

int main(){fastio
    ll a,b;cin>>n>>a>>b;
    ll ca=count(a),cb=count(b);
    if(abs(ca-cb)%2==0){
        cout<<"NO"<<endl;
        return 0;
    }else{
        cout<<"YES"<<endl;
    }
    vector<ll>ans=cal(a,b,0);
    for(auto x:ans)cout<<x<<" ";cout<<endl;
    
    return 0;
}


Measured memory_bytes: 2416