//実装が重そうな問題はある程度考えてから書く
//初期化を忘れずに（特に二分探索とか）
//コーナーケースを考えて（特に場合分けとか）
//不可解すぎるバグは配列外参照（配列の長さ）を検討
#include "bits/stdc++.h"
#define YES "YES"
#define Yes "Yes"
#define NO "NO"
#define No "No"
#define YESNO(x) OUT(three(x,YES,NO))
#define YesNo(x) OUT(three(x,Yes,No))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b)  for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(a);i>=(LL)(b);i--)
#define REP(i,b) FOR(i,zero,b)
#define rep REP
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,b-1,zero)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB emplace_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define int long long
#define zero 0LL
#define all ALL
#define pb PB
using namespace std;
template<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }
template<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }
template<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }
typedef long long LL;
typedef LL ll;
typedef double ld;
typedef LL ut;
const LL INF = 1LL << 60;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef priority_queue<ppr, Vppr ,greater<ppr> > PQ;
inline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }OUT(""); }
int dx[] = { 0,1,0,-1,1,1,-1,-1,0 }, dy[] = { 1,0,-1,0,1,-1,1,-1,0 };
const int SIZE1 =5e5 + 1000;
const int SIZE2 = 2010;
const int SIZE3 = 301;
const int SIZE = SIZE1;
const LL p = 7 + 1e9;const long double EPS = 1e-7;
ut N, M, K, X, L, Y,H,W,Q,D;
// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;
VI edges[SIZE];
LL vals[SIZE], nums[SIZE], maps[SIZE2][SIZE2], answer = zero;
LL btimes[SIZE];
//LL A[SIZE], B[SIZE],I[SIZE];
LL A, B;
LL ranks[SIZE];
string s, t;
VI v[2];
LL times = 0;
LL inv(int x) {
	if (x == 1) return 0;
	return inv(x / 2) + 1;
}
LL next(int x) {
	vals[times + 1] = vals[times] ^ (1<<x);
	times++;
	return 0;
}
LL solve() {
	cin >> N >> A >> B;
	if (N == 1) {
		cout << "YES" << endl;
		cout << A <<" "<<B << endl;
		exit(0);
	}
	M = 1 << N;
	LL C = A ^ B;
	LL bits = 0;
	REP(i, N) {
		if (1 & (C >> i)) {
			bits++;
		}
	}
	if (bits % 2 == 0) return 0;
	REP(i, N) {
		if (1 & (C >> i)) {
			v[1].pb(i);
		}
		else {
			v[0].pb(i);
		}
	}
	REP(i, 1 << v[1].size()) {
		FOR(j,1,1 << v[0].size()) {
			LL q = j & (-j);
			next(v[0][inv(q)]);
		}
		if (i == (1 << v[1].size()) - 1) break;
		for (int j = 0; j < v[1].size();j+=2) {
			if (ranks[j] == 3) {
				ranks[j] = 0;
				continue;
			}
			if (j + 1 == v[1].size()) {
				next(v[1][j]);
				break;
			}
			LL revt =( btimes[j] / 3 + 1 )== (1 << ((LL)v[1].size() - 2-j));
			//cout << revt <<" " << (j * 2 + (1 ^ revt))<< endl;
			if (btimes[j]%3==0 or btimes[j]%3==2) {
			//	assert(j * 2 ^ revt < v[1].size());
				next(v[1][j^revt]);
			}
			else {
				//assert((j * 2+(1 ^ revt)) < v[1].size());
				next(v[1][(j+ (1 ^ revt))]);
			}
			btimes[j]++;
			ranks[j]++;
			break;
		}	
	}
	return 1;
}
signed main() {
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(10);
	if (solve()) {
		cout << "YES" << endl;

		REP(i, M) {
			if (i) cout << " ";
			cout << ((vals[i])^A);
		}
		cout << endl;
		sort(vals, vals + (1 << N));

		REP(i, M - 1) assert(vals[i] == vals[i + 1] - 1);

	}
	else {
		cout << "NO" << endl;
	}
	//cout << solve() << endl;
	//	cin >> N;
	return 0;
}

Measured memory_bytes: 17024