#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;

// chmax, chmin
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail {
template <typename T, std::size_t NDIMS>
struct vector_builder {
  using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
    if (!dims.empty()) dims.pop_back();
    return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
  }
};

template <typename T>
struct vector_builder<T, 1> {
  using type = std::vector<T>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    return type(dims.empty() ? 0 : dims.back(), v);
  }
};
}  // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T& v, SIZE_T... dims) {
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T& data, vector<int>& iter) {
  cout << data << " ";
}
template <typename T>
void dump(const vector<T>& data, vector<int>& iter) {
  for (auto elem : data) dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>>& data, vector<int>& iter) {
  for (auto elem : iter) {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++) {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T>& data, int dummy) {
  for (int i = 0; i < data.size(); i++) {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T& data) {  // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

const string YES = "YES";
const string NO = "NO";

vector<int> make(int start, vector<int> fixed) {
  vector<int> ans;
  int N = fixed.size();
  for (int i = 0; i < (1 << N); i++) ans.push_back(i ^ (i >> 1));

  if (N >= 2) {
    for (int i = 0; i < ans.size(); i++) {
      int ok = (ans[i] >= (1 << (N - 1)));
      ans[i] = (ans[i] % (1 << (N - 1))) * 2 + ok;
    }
  }
  /*
  for (int i = 0; i < ans.size(); i++) {
    int a = ans[i] & mask;
    int b = (ans[i] - a) >> cnt;
    ans[i] = start ^ (b + a * (1 << (N - cnt)));
  }
  */
  for (int i = 0; i < ans.size(); i++) {
    int next = 0;
    for (int j = 0; j < N; j++) {
      int digit = (ans[i] >> j) & 1;
      next += digit * (1 << fixed[j]);
    }
    next ^= start;
    ans[i] = next;
  }
  /*
  if (!end) {
    ans.push_back(ans.back() ^ (1 << pivotA));
  }
  */
  return ans;
}

void solve(long long N, long long A, long long B) {
  vector<int> ans;

  LL diff = B ^ A;

  vector<int> pivots;
  vector<int> amari;
  for (int i = 0; i < N; i++) {
    if ((diff >> i) & 1) {
      pivots.push_back(i);
    } else
      amari.push_back(i);
  }
  if (pivots.size() % 2 == 0) {
    cout << "NO" << endl;
    return;
  }

  cout << "YES" << endl;
  int cur = A;
  for (int i = 0; i < pivots.size(); i += 2) {
    vector<int> tmp;
    vector<int> fixed = {pivots[i]};
    for (int j = 0; j < i; j += 2) fixed.push_back(pivots[j]);
    for (int j = i + 2; j < pivots.size(); j++) fixed.push_back(pivots[j]);
    for (int k : amari) fixed.push_back(k);

    // cout << fixed.size() << endl;
    vector<int> ret = make(cur, fixed);
    for (auto r : ret) ans.push_back(r);
    if (i + 1 < pivots.size()) cur = ans.back() ^ (1 << pivots[i + 1]);
  }

  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i];
    if (i < ans.size() - 1)
      cout << " ";
    else
      cout << endl;
  }
}

int main() {
  cout << setprecision(10);
  long long N;
  scanf("%lld", &N);
  long long A;
  scanf("%lld", &A);
  long long B;
  scanf("%lld", &B);
  solve(N, A, B);
  return 0;
}


Measured memory_bytes: 1780