#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int T, n, m, a, b;

vi solve(int n, int x) {
    vi v1, v2;
    int f = -1;
    REP(i, 1 << n) {
        int y = i ^ (i >> 1);
        if (f != -1 && i % 2 == 1) f = !f;
        if (x == y) {
            f = 1;
        }
        (f != 1 ? v1 : v2).push_back(y);
    }
    RREP(i, v2.size()) v1.push_back(v2[i]);
    return v1;
}

void verify(int a, int b, const vi &ans) {
    if (a != ans[0]) {
        cerr << "first not correct" << endl;
        assert(false);
    }
    if (b != ans.back()) {
        cerr << "last not correct" << endl;
        assert(false);
    }
    set<int> s(ans.begin(), ans.end());
    if (s.size() != ans.size()) {
        cerr << "not distinct" << endl;
        assert(false);
    }

    REP(i, ans.size() - 1) {
        if (__builtin_popcount(ans[i] ^ ans[i + 1]) != 1) {
            cerr << "not grey "<<  i << ": " << ans[i] << ", " << ans[i + 1] << endl;
            assert(false);
        }
    }
}

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    while(cin >> n >> a >> b){
        if (__builtin_popcount(a ^ b) % 2 == 0) {
            cout << "NO" << endl;
        } else {
            cout << "YES" << endl;
            vi ans = solve(n, a ^ b);
            REP(i, ans.size()) cout << (ans[i] ^ a) << " \n"[i + 1 == ans.size()];
        }
    }
    return 0;
}


Measured memory_bytes: 1784