#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i, a, n) for(LL i = (a), i##_max = (n); i < i##_max; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##min = (a); i >= i##min; --i)
#define ALL(arr) (arr).begin(), (arr).end()
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(NULL); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
template <class T>
T Next() { T buf; cin >> buf; return buf; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "UnionFind.h"
#include "Graph.h"
#include "Range.h"
#include "Global.h"
#include "FlowSolver.h"
#include "Tree.h"
#include "SuffixArray.h"
#include "Matrix.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "BIT.h"
#include "Rational.h"
#include "Position.h"
#include "Factorization.h"
#include "Math.h"
#include "LazySegmentTree.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
// template <class T>
// auto Is(const T& value) { return [value](const auto& comparand) -> bool { return comparand == value; }; }
#endif

int N;
uint A, B;

int ok(uint n) {
	int cnt = 0;
	while (n > 0) {
		cnt += n & 1;
		n >>= 1;
	}
	return cnt % 2 == 1;
}

bool used[1 << 17];
void DFS(uint from, uint b, vector<uint>& path) {
	if (used[from]) return;
	if (from == b) return;
	used[from] = true;
	path.push_back(from);
	REP(k, 0, N) {
		int to = from ^ (1 << k);
		DFS(to, b, path);
	}
}

vector<uint> gray(int n) {
	vector<uint> ret;
	REP(i, 0, 1 << n) {
		ret.push_back(i ^ (i >> 1));
	}
	return ret;
}

uint arrg(uint a, uint fix) {
	int k = 0;
	uint ret = 0;
	REP(f, 0, N) {
		if (fix & (1 << f)) continue;
		ret |= (((a >> k) & 1) << f);
		++k;
	}
	return ret;
}

int main() {
	cin >> N >> A >> B;
	if (ok(A ^ B)) {
		cout << "YES" << endl;

		vector<uint> ans;
		uint a = A;
		uint b = B;
		uint fix = 0;
		REM(cnt, 0, N) {
			uint x = a ^ b;

			int kd = 0;
			REP(k, 0, N) {
				if (x & (1 << k)) {
					kd = k;
					break;
				}
			}
			fix |= (1 << kd);

			auto v = gray(cnt);
			for (uint g : v) {
				uint arr = arrg(g, fix);
				ans.push_back(a ^ arr);
			}

			a = ans.back() ^ (1 << kd);
		}
		ans.push_back(b);

		REP(i, 0, ans.size()) {
			cout << ans[i] << (i + 1 == ans.size() ? '\n' : ' ');
		}
	} else {
		cout << "NO" << endl;
	}
	return 0;
}

Measured memory_bytes: 1780