#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

const string YES = "YES";
const string NO = "NO";

lint N, A, B, C;

vector<int> gen(vector<int> d)
{
    if (d.size() == 0) return vector<int>{0};
    if (d.size() == 1) return vector<int>{0, POW2(d[0])};

    int a = POW2(d[SZ(d) - 2]), b = POW2(d[SZ(d) - 1]);
    d.pop_back();
    d.pop_back();
    vector<int> tmp = gen(d);
    int L = SZ(tmp);
    tmp.resize(L * 4);
    REP(i, L) tmp[i + L] = a xor tmp[L - 1 - i];
    REP(i, L)
    {
        if (i % 2 == 0)
        {
            tmp[L * 2 + i * 2] = tmp[i] xor a xor b;
            tmp[L * 2 + i * 2 + 1] = tmp[i] xor b;
        }
        else
        {
            tmp[L * 2 + i * 2] = tmp[i] xor b;
            tmp[L * 2 + i * 2 + 1] = tmp[i] xor b xor a;
        }
    }
    return tmp;
}
int main()
{
    cin >> N >> A >> B;
    C = A xor B;
    // 0からCまでのを構成する

    if (__builtin_popcountll(C) % 2 == 0)
    {
        cout << NO << endl;
        return 0;
    }
    vector<int> d_off, d_on;
    REP(i, N) if ((C & POW2(i)) == 0) d_off.push_back(i); else d_on.push_back(i);
    // dbg(d_off);
    // dbg(d_on);

    vector<int> mu = gen(d_off);
    // dbg(mu);
    vector<int> hoge = gen(d_on);
    // dbg(hoge);

    vector<int> ans(POW2(N));
    int now = 0;
    bool flg = true;
    for (auto v : hoge)
    {
        REP(i, mu.size())
        {
            if (flg) ans[now] = v xor mu[i];
            else ans[now] = v xor mu[SZ(mu) - 1 - i];
            now++;
        }
        flg = !flg;
    }
    for (auto &v : ans) v = v xor A;
    puts("YES");
    for (auto v : ans) printf("%d ", v);
    puts("");
}


Measured memory_bytes: 1664