import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, A, B;
int[] ans;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = readInt();
      B = readInt();
      if (popcnt(A ^ B) % 2 != 0) {
        int[] ans;
        int p = (1 << N) - 1;
        for (int a = A; a != B; ) {
          debug {
            writeln("ans = ", ans);
          }
          int im = -1;
          foreach (i; 0 .. N) {
            if ((p >> i) & 1) {
              if (((a ^ B) >> i) & 1) {
                im = i;
              }
            }
          }
          assert(im != -1);
          p ^= 1 << im;
          int[] js;
          foreach (j; 0 .. N) {
            if ((p >> j) & 1) {
              js ~= j;
            }
          }
          const len = cast(int)(js.length);
          ans ~= a;
          foreach (k; 1 .. 1 << len) {
            a ^= 1 << js[bsf(k)];
            ans ~= a;
          }
          a ^= 1 << im;
        }
        ans ~= B;
        assert(ans.length == 1 << N);
        foreach (k; 1 .. 1 << N) {
          assert(popcnt(ans[k - 1] ^ ans[k]) == 1);
        }
        writeln("YES");
        writeln(ans.to!string.replaceAll(regex(`[\[\],]`), ""));
      } else {
        writeln("NO");
      }
    }
  } catch (EOFException e) {
  }
}
