#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int k, x; cin >> k >> x;
  if (x == 0) {
    cout << "Yes\n" << 1 << '\n' << (k ^ 1) << '\n';
    return 0;
  }
  vector<int> a{1, 2, 4, 8, 16, 32};
  int p = 1;
  if (k == 0) {
    if (__builtin_popcount(x + 1) > 1) {
      cout << "No\n";
      return 0;
    }
    while (((x + 1) >> (p - 1) & 1) == 0) ++p;
  } else {
    if (__builtin_popcount(x) > 1) {
      cout << "No\n";
      return 0;
    }
    if (k >= 64) a.emplace_back(k);
    while (((x + 1) >> p & 1) == 0) ++p;
  }
  FOR(i, 3, 64) {
    if (p > 0 && __builtin_popcount(i) > 1) {
      a.emplace_back(i);
      --p;
    }
  }
  int n = a.size();
  cout << "Yes\n" << n << '\n';
  REP(i, n) cout << a[i] << " \n"[i + 1 == n];
  return 0;
}