// {{{ header
#include <bits/stdc++.h>
using namespace std;

using i8   = int8_t;
using u8   = uint8_t;
using i16  = int16_t;
using u16  = uint16_t;
using i32  = int32_t;
using u32  = uint32_t;
using i64  = int64_t;
using u64  = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;

using f32  = float;
using f64  = double;
using f80  = __float80;
using f128 = __float128;
// }}}

constexpr i64 INF = 1'010'000'000'000'000'000LL;

constexpr i64 MOD = 1'000'000'007LL;

constexpr f64 EPS = 1e-12;

constexpr f64 PI = 3.14159265358979323846;

// {{{ util
#define FOR(i, start, end) for(i64 i = (start), i##_end=(end); i < i##_end; ++i)
#define REP(i, n) FOR(i, 0, n)

#define ALL(f,c,...) (([&](decltype((c)) cccc) { return (f)(begin(cccc), end(cccc), ## __VA_ARGS__); })(c))
#define SLICE(f,c,l,r,...) (([&](decltype((c)) cccc, decltype((l)) llll, decltype((r)) rrrr) {\
    auto iiii = llll <= rrrr ? begin(cccc)+llll : end(cccc);\
    auto jjjj = llll <= rrrr ? begin(cccc)+rrrr : end(cccc);\
    return (f)(iiii, jjjj, ## __VA_ARGS__);\
})(c,l,r))

#define GENERIC(f) ([](auto&&... args) -> decltype(auto) { return (f)(forward<decltype(args)>(args)...); })

template<typename C>
i64 SIZE(const C& c) { return static_cast<i64>(c.size()); }

template<typename T, size_t N>
i64 SIZE(const T (&)[N]) { return static_cast<i64>(N); }

bool is_odd (i64 x) { return x % 2 != 0; }
bool is_even(i64 x) { return x % 2 == 0; }

template<typename T> i64 cmp(T x, T y) { return (y<x) - (x<y); }
template<typename T> i64 sgn(T x) { return cmp(x, T(0)); }

// Haskell の divMod と同じ
pair<i64,i64> divmod(i64 a, i64 b) {
    i64 q = a / b;
    i64 r = a % b;
    if((b>0 && r<0) || (b<0 && r>0)) {
        --q;
        r += b;
    }
    return {q,r};
}

i64 div_ceil(i64 a, i64 b) {
    i64 q = a / b;
    i64 r = a % b;
    if((b>0 && r>0) || (b<0 && r<0))
        ++q;
    return q;
}

i64 div_floor(i64 a, i64 b) {
    return divmod(a,b).first;
}

i64 modulo(i64 a, i64 b) {
    return divmod(a,b).second;
}

bool feq(f64 x, f64 y, f64 eps=EPS) {
    return fabs(x-y) < eps;
}

template<typename T, typename U>
bool chmax(T& xmax, const U& x) {
    if(xmax < x) {
        xmax = x;
        return true;
    }
    return false;
}

template<typename T, typename U>
bool chmin(T& xmin, const U& x) {
    if(x < xmin) {
        xmin = x;
        return true;
    }
    return false;
}

template<typename InputIt>
auto SUM(InputIt first, InputIt last) {
    using T = typename iterator_traits<InputIt>::value_type;
    return accumulate(first, last, T());
}

template<typename ForwardIt, typename UnaryOperation>
ForwardIt transform_self(ForwardIt first, ForwardIt last, UnaryOperation op) {
    return transform(first, last, first, op);
}

template<typename C>
void UNIQ(C& c) {
    c.erase(ALL(unique,c), end(c));
}

template<typename BinaryFunc, typename UnaryFunc>
auto ON(BinaryFunc bf, UnaryFunc uf) {
    return [bf,uf](const auto& x, const auto& y) {
        return bf(uf(x), uf(y));
    };
}

template<typename F>
auto LT_ON(F f) { return ON(less<>(), f); }

template<typename F>
auto GT_ON(F f) { return ON(greater<>(), f); }

template<typename T>
void RD(T& x) {
    cin >> x;
#ifdef PROCON_LOCAL
    assert(cin);
#endif
}

template<typename T>
void RD(vector<T>& v, i64 n) {
    v.reserve(n);
    REP(_, n) {
        T e; RD(e);
        v.emplace_back(e);
    }
}

template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
    for(auto first = begin(v), it = first; it != end(v); ++it) {
        if(it != first)
            out << ' ';
        out << *it;
    }
    return out;
}

template<typename T1, typename T2>
ostream& operator<<(ostream& out, const pair<T1,T2>& p) {
    return out << '(' << p.first << ',' << p.second << ')';
}

void PRINT() {}

template<typename T, typename... TS>
void PRINT(const T& x, const TS& ...args) {
    cout << x;
    if(sizeof...(args)) {
        cout << ' ';
        PRINT(args...);
    }
}

template<typename... TS>
void PRINTLN(const TS& ...args) {
    PRINT(args...);
    cout << '\n';
}

template<typename T>
void DBG_IMPL(i64 line, const char* expr, const T& value) {
#ifdef PROCON_LOCAL
    cerr << "[L " << line << "]: ";
    cerr << expr << " = " << value << "\n";
#endif
}

#define DBG(expr) DBG_IMPL(__LINE__, #expr, (expr))
// }}}

// {{{ init
struct ProconInit {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;

    ProconInit() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(IOS_PREC);
#ifdef PROCON_LOCAL
        cerr << fixed << setprecision(IOS_PREC);
#endif
        if(AUTOFLUSH)
            cout << unitbuf;
    }
} PROCON_INIT;
// }}}

//--------------------------------------------------------------------

i64 N;
i64 A, B;

i64 MSB(i64 x, i64 n) {
    return x & (1<<(n-1));
}

i64 CLEAR_MSB(i64 x, i64 n) {
    return x & ~(1<<(n-1));
}

pair<bool,vector<i64>> f(i64 n, i64 a, i64 b) {
    if(n == 1) {
        if(a == b) return { false, {} };
        return { true, { a, b } };
    }

    i64 ha = MSB(a,n);
    i64 hb = MSB(b,n);
    i64 la = CLEAR_MSB(a,n);
    i64 lb = CLEAR_MSB(b,n);

    if(!ha  && !hb) {
        bool ok1; vector<i64> route1; tie(ok1,route1) = f(n-1,la,lb);
        if(!ok1) return { false, {} };
        bool ok2; vector<i64> route2; tie(ok2,route2) = f(n-1,la,route1[1]);
        if(!ok2) return { false, {} };

        vector<i64> res;
        res.reserve(1<<n);
        res.emplace_back(la);
        for(auto e : route2) {
            res.emplace_back((1<<(n-1)) | e);
        }
        FOR(i, 1, SIZE(route1)) {
            res.emplace_back(route1[i]);
        }
        return { true, res };
    }
    else if(!ha && hb) {
        if((la^1) == lb) return { false, {} };
        bool ok1; vector<i64> route1; tie(ok1,route1) = f(n-1,la^1,lb);
        if(!ok1) return { false, {} };
        bool ok2; vector<i64> route2; tie(ok2,route2) = f(n-1,la,la^1);
        if(!ok2) return { false, {} };

        vector<i64> res;
        res.reserve(1<<n);
        for(auto e : route2) {
            res.emplace_back(e);
        }
        for(auto e : route1) {
            res.emplace_back((1<<(n-1)) | e);
        }
        return { true, res };
    }
    else if(ha && !hb) {
        if((la^1) == lb) return { false, {} };
        bool ok1; vector<i64> route1; tie(ok1,route1) = f(n-1,la^1,lb);
        if(!ok1) return { false, {} };
        bool ok2; vector<i64> route2; tie(ok2,route2) = f(n-1,la,la^1);
        if(!ok2) return { false, {} };

        vector<i64> res;
        res.reserve(1<<n);
        for(auto e : route2) {
            res.emplace_back((1<<(n-1)) | e);
        }
        for(auto e : route1) {
            res.emplace_back(e);
        }
        return { true, res };
    }
    else if(ha && hb) {
        bool ok1; vector<i64> route1; tie(ok1,route1) = f(n-1,la,lb);
        if(!ok1) return { false, {} };
        bool ok2; vector<i64> route2; tie(ok2,route2) = f(n-1,la,route1[1]);
        if(!ok2) return { false, {} };

        vector<i64> res;
        res.reserve(1<<n);
        res.emplace_back((1<<(n-1)) | la);
        for(auto e : route2) {
            res.emplace_back(e);
        }
        FOR(i, 1, SIZE(route1)) {
            res.emplace_back((1<<(n-1)) | route1[i]);
        }
        return { true, res };
    }

    assert(false);
}

void solve() {
    bool ok; vector<i64> ans; tie(ok,ans) = f(N, A, B);

    if(!ok) {
        PRINTLN("NO");
    }
    else {
        PRINTLN("YES");
        PRINTLN(ans);
    }
}

signed main() {
    RD(N);
    RD(A); RD(B);

    solve();

    return 0;
}


Measured memory_bytes: 3472