//#define NDEBUG

#pragma region cp_template

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

  using i32 = std::int32_t;
  using i64 = std::int64_t;
  using u32 = std::uint32_t;
  using u64 = std::uint64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class F> class rec_lambda {
    F f;

  public:
    rec_lambda(F&& f) : f(std::move(f)) {}
    template <class... Args> auto operator()(Args&&... args) const {
      return f(*this, std::forward<Args>(args)...);
    }
  };
  template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }
  constexpr char eoln = '\n';
  template <class T> T ceildiv(const T& l, const T& r) {
    return l / r + (l % r != 0 ? 1 : 0);
  }

} // namespace n91

#pragma endregion cp_template

namespace n91 {

  void main_() {
    /*
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    //*/
    u32 k = scan<u32>();
    u32 x = scan<u32>();
    if (x == 0) {
      std::cout << "Yes" << eoln;
      std::cout << 1 << eoln;
      std::cout << (k ? 0 : 1) << " " << eoln;
      return;
    }
    if (k == 0) {
      ++x;
    }
    u32 p = 0;
    while (x % 2 == 0) {
      x /= 2;
      ++p;
    }
    if (x != 1) {
      std::cout << "No" << eoln;
      return;
    }
    const usize bsf = [&]() -> usize {
      if (k == 0) {
        return 20;
      }
      usize r = 0;
      u32 kk = k;
      while (kk % 2 == 0) {
        kk /= 2;
        ++r;
      }
      return r;
    }();
    std::vector<u32> base;
    if (k != 0) {
      base.push_back(k);
    }
    for (const usize i : rep(0, 10)) {
      if (base.size() == 10) {
        break;
      }
      if (bsf == i) {
        continue;
      }
      base.push_back(1 << i);
    }
    auto ans = base;
    for (const usize i : rep(0, p)) {
      u32 x = 0;
      for (const usize j : rep(0, 10)) {
        if (i >> j & 1) {
          x ^= base[j];
        }
      }
      ans.push_back(x);
    }
    std::cout << "Yes" << eoln;
    std::cout << ans.size() << eoln;
    for (auto e : ans) {
      std::cout << e << " ";
    }
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}