#include <bits/stdc++.h>
using namespace std;

using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using ll = long long int;
using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;

const double eps = 1e-9;
const double INFD = numeric_limits<double>::infinity();
const double PI = 3.14159265358979323846;
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#define Loopll(i, n) for(ll i = 0; i < (ll)n; i++)
#define Loop1(i, n) for(int i = 1; i <= (int)n; i++)
#define Loopll1(i, n) for(ll i = 1; i <= (ll)n; i++)
#define Loopr(i, n) for(int i = (int)n - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = (ll)n - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = (int)n; i >= 1; i--)
#define Looprll1(i, n) for(ll i = (ll)n; i >= 1; i--)
#define Foreach(buf, container) for(auto buf : container)
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= (h) ? (h) - 1 : (sum)), j = (sum) - i; i >= 0 && j < (w); i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= (w) ? (w) - 1 : (sum)), i = (sum) - j; j >= 0 && i < (h); j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define printv(vector) Loop(ex_i, vector.size()) { cout << vector[ex_i] << " "; } cout << endl;
#define printmx(matrix) Loop(ex_i, matrix.size()) { Loop(ex_j, matrix[ex_i].size()) { cout << matrix[ex_i][ex_j] << " "; } cout << endl; }
#define quickio() ios::sync_with_stdio(false); cin.tie(0);
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
#define Comp(type_t) bool operator<(const type_t &another) const
#define fst first
#define snd second
bool nearlyeq(double x, double y) { return abs(x - y) < eps; }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vi xs, ll t) { Foreach(x, xs) if (!(x >= 0 && x < t)) return false; return true; }
int ceillog2(ll x) { int ret = 0;	x--; while (x > 0) { ret++; x >>= 1; } return ret; }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (m * m <= x ? 0 : -1); }
ll ceilsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }
ll lcm(ll m, ll n) { return m * n / gcd(m, n); }

/*******************************************************/

void failed() {
	cout << "NO" << endl;
	exit(0);
}

int del_bit(int x, int p) {
	int y = 1 << p;
	return x / (y << 1) * y + x % y;
}

int add_bit(int x, int p, int b) {
	int y = 1 << p;
	return x / y * (y << 1) + x % y + y * b;
}

vi solve(int a, int b, int k) {
	int cnt = 0;
	Loop(i, k) {
		if (a & (1 << i)) cnt ^= 1;
		if (b & (1 << i)) cnt ^= 1;
	}
	if (cnt == 0) failed();
	if (k == 1) return { a, b };
	else {
		int pos;
		int bta, btb;
		Loop(i, k) {
			if ((a & (1 << i)) != (b & (1 << i))) {
				pos = i;
				bta = (a & (1 << i)) ? 1 : 0;
				btb = 1 - bta;
				break;
			}
		}
		int xb, xa;
		Loop(i, k) {
			if (i == pos) continue;
			int x = a ^ (1 << i);
			if ((x ^ (1 << pos)) != b) {
				xb = x;
				xa = x ^ (1 << pos);
				break;
			}
		}
		vi va = solve(del_bit(a, pos), del_bit(xb, pos), k - 1);
		vi vb = solve(del_bit(xa, pos), del_bit(b, pos), k - 1);
		vi ret(1 << k);
		Loop(i, 1 << (k - 1)) {
			ret[i] = add_bit(va[i], pos, bta);
			ret[i + (1 << (k - 1))] = add_bit(vb[i], pos, btb);
		}
		return ret;
	}
}

int main() {
	int k, a, b; cin >> k >> a >> b;
	vi ans = solve(a, b, k);
	cout << "YES" << endl;
	printv(ans);
}

Measured memory_bytes: 1648