#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SZ(x) ((int)((x).size()))

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

template<class TH>
void _dbg(const char* name, TH val){
    clog << name << ": " << val << endl;
}
template<class TH, class... TA>
void _dbg(const char* names, TH curr_val, TA... vals) {
    while(*names != ',') clog << *names++;
    clog << ": " << curr_val << ", ";
    _dbg(names+1, vals...);
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
    #define dbg_arr(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg(...)
    #define dbg_arr(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

vector<int> generate(int N, int d) {
    assert(d % 2 == 1);
    if (d == 1) {
        if (N == 1) return {0, 1};
        auto vec1 = generate(N-1, 1);
        auto vec2 = vec1;
        reverse(vec2.begin(), vec2.end());
        for (int& x : vec2) x += 1<<(N-1);
        for (int x : vec2) vec1.push_back(x);
        return vec1;
    }
    auto vec = generate(N-2, d-2);
    vector<int> c1 = {0,1,3,2};
    vector<int> c2 = {2, 0, 1, 3};
    vector<int> c3 = {2, 3, 1, 0};
    for (int& x : c1) x <<= N-2;
    for (int& x : c2) x <<= N-2;
    for (int& x : c3) x <<= N-2;
    vector<int> res;
    for (int it = 0; it < SZ(vec); it++) {
        int x = vec[it];
        if (it%2 == 0) for (int z : c1) res.push_back(x + z);
        else if (it < SZ(vec)-1) for (int z : c3) res.push_back(x + z);
        else for (int z : c2) res.push_back(x + z);
    }
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!
    // cout << generate(5, 3) << endl;
    // return 0;
    int N, A, B;
    cin >> N >> A >> B;
    vector<int> same, diff;
    vector<bool> tipo(N);
    for (int i = 0; i < N; i++) {
        if ((A&(1<<i)) == (B&(1<<i))) {
            same.push_back(i);
            tipo[i] = 0;
        }
        else {
            diff.push_back(i);
            tipo[i] = 1;
        }
    }
    if (SZ(diff)%2 == 0) {
        cout << "NO\n";
        return 0;
    }
    cout << "YES\n";
    vector<int> vec = generate(N, SZ(diff));
    // dbg(vec);
    // cout << vec << endl;
    // cout << tipo << endl;
    // dbg(A);
    // set<int> vis;
    // int prevris = A^1;
    for (int x : vec) {
        int s = 0;
        int d = SZ(same);
        int ris = 0;
        for (int i = 0; i < N; i++) {
            if (tipo[i] == 0) {
                if (((A&(1<<i))>0) ^ (((x&(1<<s)))>0)) ris += 1<<i;
                s++;
            } else {
                if (((A&(1<<i))>0) ^ (((x&(1<<d)))>0)) ris += 1<<i;
                d++;
            }
        }
        // assert(!vis.count(ris));
        // assert(__builtin_popcount(ris^prevris) == 1);
        // prevris = ris;
        // vis.insert(ris);
        cout << ris << " ";
    }
}


Measured memory_bytes: 1912