#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int N, A, B;

vector<int> one(int k) {
	if(k == 1) {
		vector<int> vec;
		vec.pb(0);
		vec.pb(1);
		return vec;
	}
	else {
		vi vec = one(k - 1);
		int n = sz(vec);
		vi res(n * 2);
		rep(i, 0, n) {
			res[i] = vec[i];
		}
		int bit = (1 << (k - 1)) ^ (1 << (k - 2));
		rep(i, 0, sz(vec)) {
			res[i + n] = vec[i] ^ bit;
		}
		return res;
	}
}

int sb(int bit, int a, int b) {
	int va = bit & (1 << a);
	int vb = bit & (1 << b);
	bit ^= va;
	bit ^= vb;
	va = min(va, 1);
	vb = min(vb, 1);
	swap(va, vb);
	bit ^= (1 << a) * va;
	bit ^= (1 << b) * vb;
	return bit;
}

vector<int> shift(int k, int a, const vi& vec) { //k bit, a bit is one
	int n = sz(vec);
	vector<int> res(n * 2);
	vector<int> on = one(k);
	rep(i, 0, n) res[i] = sb(on[i], k - a, k - 1);
	int bit = (1 << (k - a)) ^ (1 << k);
	rep(i, 0, n) res[i + n] = bit ^ vec[i];
	rep(i, 0, n * 2) res[i] = sb(res[i], k - a, k);
	return res;
}

vector<int> get(int k, int a) {
	if(a == 1) return one(k);
	vector<int> vec = shift(k - 2, a - 2, get(k - 2, a - 2));
	vector<int> res(1 << k);
	vector<int> on = one(k - 1);
	rep(i, 0, (1 << (k - 1))) {
		res[i] = on[i];
	}
	int bit = (1 << (k - 1)) ^ (1 << (k - 2));
	rep(i, 0, (1 << (k - 1))) {
		res[i + (1 << (k - 1))] = bit ^ vec[i];
	}
	return res;
}

void solve() {
	cin >> N >> A >> B;
	int bit = A ^ B;
	int cnt = __builtin_popcount(bit);
	if(cnt % 2 == 0) {
		cout << "NO\n";
	}
	else {
		cout << "YES\n";
		vector<int> vec = get(N, cnt);
		int at = N - cnt;
		rep(i, 0, N) {
			if(bit & (1 << i)) {
				rep(j, 0, sz(vec)) {
					vec[j] = sb(vec[j], i, at);
				}
				at++;
			}
		}
		rep(i, 0, sz(vec)) {
			cout << (vec[i] ^ A) << (i != sz(vec) - 1 ? " " : "\n");
		}
		
	}
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 1652