#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int K, X; cin >> K >> X;

    if(K == 0) X++;

    if(X&(X-1) != 0) {cout << "No\n"; return 0;}

    int n = __builtin_ctz(X);

    vector<int> ans;
    rep(i, 9) ans.eb(1<<i);

    K &= ~((1<<9)-1);
    if(K != 0) ans.eb(K);

    rep(i, n) ans.eb(i);

    cout << "Yes\n";
    cout << sz(ans) << '\n';
    rep(i, sz(ans)){
        cout << ans[i] << (i == sz(ans)-1? '\n' : ' ');
    }
}