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

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
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); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
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; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair

string bit_print(int a, int n) {
  string s;
  int mask = 1 << (n - 1);
  while (mask > 0) {
    if (a & mask) s += '1';
    else s += '0';
    mask >>= 1;
  }
  return s;
}

int bit_count(int a) {
  int cnt = 0;
  while (a > 0) {
    if (a & 1) cnt++;
    a >>= 1;
  }
  return cnt;
}

int bit_swap(int a, vector<pii> &swaps) {
  int add = 0, sub = 0;
  rep (i, swaps.size()) {
    int i1 = swaps[i].first, i2 = swaps[i].second;
    if (a & (1 << i1)) {
      sub += 1 << i1;
      add += 1 << i2;
    }
    if (a & (1 << i2)) {
      sub += 1 << i2;
      add += 1 << i1;
    }
  }
  a -= sub;
  a += add;
  return a;
}

vi solve(int x) {
  vi retu;
  rep1 (i, (1 << x) - 1) {
    int mask = 1;
    int cnt = 1;
    while (!(mask & i)) {
      mask <<= 1;
      cnt++;
    }
    retu.push_back(1 << (x - cnt));
  }
  return retu;
}


int main() {
  int m;

  
  int n, a, b;
  cin >> n >> a >> b;
  
  int mask = a;
  a = 0;
  b ^= mask;

  if (bit_count(b) % 2 == 0) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;

  vector<pii> swaps;
  int l = 0, r = n - 1;
  while (l < r) {
    while (l < n && (b & (1 << l)) == 0) {
      l++;
    }
    while (r >= 0 && (b & (1 << r))) {
      r--;
    }
    if (l < r) {
      swaps.push_back({l, r});
      l++; r--;
    }
  }
  //DEBUG_VEC(swaps);

  b = bit_swap(b, swaps);

  vi ans;
  ans.push_back(a);

  int stand = bit_count(b);

  rep (i, stand) {
    vi retu = solve(n - 1);
    rep (j, retu.size()) {
      int x = ans.back();
      x ^= retu[j];
      ans.push_back(x);
    }
    // 反転
    int x = ans.back();
    x ^= 1 << (n - 1);
    ans.push_back(x);
      
    n--;
  }
  
  vi retu = solve(n);
  rep (j, retu.size()) {
    int x = ans.back();
    x ^= retu[j];
    ans.push_back(x);
  }

  rep (i, ans.size()) {
    ans[i] = bit_swap(ans[i], swaps);
    ans[i] ^= mask;
  }

  rep (i, ans.size()) {
    cout << ans[i] << " ";
  }
  cout << endl;
}


Measured memory_bytes: 1780