import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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)); }


enum E = 20;

void main() {
  try {
    for (; ; ) {
      const K = readLong();
      long X = readLong();
      if (!K) {
        ++X;
      }
      
      long[] ans;
      if (X == 0) {
        ans = [(K + 1) % 2^^E];
      } else if (!(X & (X - 1))) {
        const k = bsf(X);
        long[] basis;
        if (K) {
          ans ~= K;
          basis ~= K;
        }
        int corank;
        for (long a = 0; ; ++a) {
          foreach (iter; 0 .. 2) {
            if (corank == k) {
              goto done;
            }
            if (a == K && iter == 0) {
              continue;
            }
            ans ~= a;
            long aa = a;
            foreach (b; basis) {
              chmin(aa, aa ^ b);
            }
            if (aa) {
              basis ~= aa;
            } else {
              ++corank;
            }
          }
        }
       done:
      }
      
      if (ans) {
        writeln("Yes");
        writeln(ans.length);
        foreach (index, a; ans) {
          if (index > 0) write(" ");
          write(a);
        }
        writeln;
      } else {
        writeln("No");
      }
    }
  } catch (EOFException e) {
  }
}