#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <time.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 5020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

vector<int> dfs(int n, int a, int b){
	//print3(a,b,n);
	if(n == 1) return {a,b};
	int A = 0, B = 0;
	int pa = pcount(a);
	int pb = pcount(b);
	rep(bit,n){
		if((a>>bit & 1) == (b>>bit & 1)){
			int t = (a>>bit & 1) * (1<<bit);
			A += t; B += t;
			a -= t; b -= t;
		}else{
			if(a>>bit & 1){
				int t = 1<<bit;
				a -= t;
				a >>= 1; b >>= 1;
				int nxt = pa & 1;
				auto left = dfs(n-1, a+A, nxt);
				auto right = dfs(n-1, nxt, b+B);
				for(auto &i : left){
					int acc = 0;
					rep(bit2,bit){
						acc += (i>>bit2 & 1) * (1<<bit2);
						i &= ~(1<<bit2);
					}
					i <<= 1;
					i += acc;
					i += 1<<bit;
				}
				for(auto &i : right){
					int acc = 0;
					rep(bit2,bit){
						acc += (i>>bit2 & 1) * (1<<bit2);
						i &= ~(1<<bit2);
					}
					i <<= 1;
					i += acc;
					left.push_back(i);
				}
				return left;
			}else{
				int t = 1<<bit;
				b -= t;
				a >>= 1; b >>= 1;
				int nxt = pb & 1;
				auto left = dfs(n-1, a+A, nxt);
				auto right = dfs(n-1, nxt, b+B);
				for(auto &i : left){
					int acc = 0;
					rep(bit2,bit){
						acc += (i>>bit2 & 1) * (1<<bit2);
						i &= ~(1<<bit2);
					}
					i <<= 1;
					i += acc;
				}
				for(auto &i : right){
					int acc = 0;
					rep(bit2,bit){
						acc += (i>>bit2 & 1) * (1<<bit2);
						i &= ~(1<<bit2);
					}
					i <<= 1;
					i += acc;
					i += 1<<bit;
					left.push_back(i);
				}
				return left;
			}
		}
	}
}

int main(){
	int n,a,b; cin >> n >> a >> b;
	if(pcount(a) % 2 == pcount(b) % 2){
		cout << "NO" << "\n";
		return 0;
	}
	puts("YES");
	auto ans = dfs(n,a,b);
	print(ans);
}

Measured memory_bytes: 4264