#include <stdio.h>
#include <bits/stdc++.h>

#define FOR(i, n)     for(lli i = 0; i < (lli)(n); ++i)
#define FORU(i, j, k) for(lli i = (j); i <= (lli)(k); ++i)
#define FORD(i, j, k) for(lli i = (j); i >= (lli)(k); --i)

#define SQ(x) ((x)*(x))

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back

using namespace std;

template<typename... As>
struct tpl : public std::tuple<As...> {
  using std::tuple<As...>::tuple;
  tpl(){}
  tpl(std::tuple<As...> const& b) { std::tuple<As...>::operator=(b); }

  template<typename T = tuple<As...> >
  typename tuple_element<0, T>::type const&
  x() const { return get<0>(*this); }
  template<typename T = tuple<As...> >
  typename tuple_element<0, T>::type&
  x() { return get<0>(*this); }

  template<typename T = tuple<As...> >
  typename tuple_element<1, T>::type const&
  y() const { return get<1>(*this); }
  template<typename T = tuple<As...> >
  typename tuple_element<1, T>::type&
  y() { return get<1>(*this); }

  template<typename T = tuple<As...> >
  typename tuple_element<2, T>::type const&
  z() const { return get<2>(*this); }
  template<typename T = tuple<As...> >
  typename tuple_element<2, T>::type&
  z() { return get<2>(*this); }

  template<typename T = tuple<As...> >
  typename tuple_element<3, T>::type const&
  w() const { return get<3>(*this); }
  template<typename T = tuple<As...> >
  typename tuple_element<3, T>::type&
  w() { return get<3>(*this); }
};

using lli   = long long int;
using llu   = long long unsigned;

using pii   = tpl<lli, lli>;
using piii  = tpl<lli, lli, lli>;
using piiii = tpl<lli, lli, lli, lli>;
using vi    = vector<lli>;
using vii   = vector<pii>;
using viii  = vector<piii>;
using vvi   = vector<vi>;
using vvii  = vector<vii>;
using vviii = vector<viii>;

template<class T>
using min_queue = priority_queue<T, vector<T>, greater<T> >;
template<class T>
using max_queue = priority_queue<T>;

template<size_t... I>
struct my_index_sequence {
  using type = my_index_sequence;
  static constexpr array<size_t, sizeof...(I)> value = { {I...} };
};

namespace my_index_sequence_detail {
  template<typename I, typename J> struct concat;
  template<size_t... I, size_t... J>
  struct concat<my_index_sequence<I...>, my_index_sequence<J...> > :
    my_index_sequence<I..., (sizeof...(I)+J)...> { };
  template<size_t N> struct make_index_sequence :
    concat<typename make_index_sequence<N/2>::type, typename make_index_sequence<N-N/2>::type>::type { };
  template <> struct make_index_sequence<0> : my_index_sequence<>{};
  template <> struct make_index_sequence<1> : my_index_sequence<0>{};
}

template<class... A>
using my_index_sequence_for = typename my_index_sequence_detail::make_index_sequence<sizeof...(A)>::type;

template<class T, size_t... I>
void print_tuple(ostream& s, T const& a, my_index_sequence<I...>){
  using swallow = int[];
  (void)swallow{0, (void(s << (I == 0? "" : ", ") << get<I>(a)), 0)...};
}

template<class T>
ostream& print_collection(ostream& s, T const& a);
template<class... A>
ostream& operator<<(ostream& s, tpl<A...> const& a);
template<class... A>
ostream& operator<<(ostream& s, tuple<A...> const& a);
template<class A, class B>
ostream& operator<<(ostream& s, pair<A, B> const& a);

template<class T, size_t I>
ostream& operator<<(ostream& s, array<T, I> const& a) { return print_collection(s, a); }
template<class T>
ostream& operator<<(ostream& s, vector<T> const& a) { return print_collection(s, a); }
template<class T, class U>
ostream& operator<<(ostream& s, multimap<T, U> const& a) { return print_collection(s, a); }
template<class T>
ostream& operator<<(ostream& s, multiset<T> const& a) { return print_collection(s, a); }
template<class T, class U>
ostream& operator<<(ostream& s, map<T, U> const& a) { return print_collection(s, a); }
template<class T>
ostream& operator<<(ostream& s, set<T> const& a) { return print_collection(s, a); }

template<class T>
ostream& print_collection(ostream& s, T const& a){
  s << '[';
  for(auto it = begin(a); it != end(a); ++it){
    s << *it;
    if(it != prev(end(a))) s << " ";
  }
  return s << ']';
}

template<class... A>
ostream& operator<<(ostream& s, tpl<A...> const& a){
  s << '(';
  print_tuple(s, a, my_index_sequence_for<A...>{});
  return s << ')';
}

template<class... A>
ostream& operator<<(ostream& s, tuple<A...> const& a){
  s << '(';
  print_tuple(s, a, my_index_sequence_for<A...>{});
  return s << ')';
}

template<class A, class B>
ostream& operator<<(ostream& s, pair<A, B> const& a){
  return s << "(" << get<0>(a) << ", " << get<1>(a) << ")";
}

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

int main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int n,a,b; cin>>n>>a>>b;
  int k = __builtin_popcount(a^b);
  if(k%2 != 1) {
    cout << "NO" << endl;
    return 0;
  }
  vi ix(n);
  int ix0=0, ix1=n-k;
  FOR(i,n) {
    if((a&(1<<i)) == (b&(1<<i))) {
      ix[i] = ix0; ix0++;
    }else{
      ix[i] = ix1; ix1++;
    }
  }
  vi r = {0,1};
  FOR(k_,k/2) {
    int cur = 0;
    vi rr;
    for(int x : r) {
      if(cur == 0) {
        rr.pb(x*4 + 0);
        rr.pb(x*4 + 2);
        rr.pb(x*4 + 3);
        rr.pb(x*4 + 1);
        cur = 1;
      } else if(cur == 1) {
        rr.pb(x*4 + 1);
        rr.pb(x*4 + 0);
        rr.pb(x*4 + 2);
        rr.pb(x*4 + 3);
        cur = 3;
      } else if(cur == 3) {
        rr.pb(x*4 + 3);
        rr.pb(x*4 + 2);
        rr.pb(x*4 + 0);
        rr.pb(x*4 + 1);
        cur = 1;
      }
    }
    assert(cur == 3);
    r = rr;
    FOR(i,r.size()-1) {
      assert(__builtin_popcount(r[i]^r[i+1]) == 1);
    }
  }
  FOR(k_,n-k) {
    vi rr;
    int cur = 0;
    for(int x : r) {
      if(cur == 0) {
        rr.pb(x*2);
        rr.pb(x*2+1);
        cur=1;
      }else{
        rr.pb(x*2+1);
        rr.pb(x*2);
        cur=0;
      }
    }
    assert(cur == 0);
    r = rr;
    FOR(i,r.size()-1) assert(__builtin_popcount(r[i]^r[i+1]) == 1);
  }
  FOR(i,(1<<n)) {
    int m = 0;
    FOR(j,n) if((r[i]&(1<<ix[j]))) m |= (1<<j);
    r[i] = a^m;
  }
  // cout << ix << endl;
  // cout << r << endl;
  cout << "YES" << endl;
  FOR(i,(1<<n)-1) assert(__builtin_popcount(r[i]^r[i+1]) == 1);
  assert(r[0] == a && r[(1<<n)-1] == b);
  FOR(i,1<<n) cout << r[i] << ' ';
  cout << endl;
  return 0;
}


Measured memory_bytes: 2992