#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

int k,x;
bool f[25];

void solve(){
    cin >> k >> x;if(k==0)x++;
    if(x==0){
        cout << "Yes" << endl;
        cout << 1 << endl;
        cout << 0 << endl;
        return;
    }
    int t=0;
    while(x>1){
        if(x%2) {
            cout << "No" << endl;
            return;
        }
        x/=2;
        t++;
    }
    cout << "Yes" << endl;
    vector<int> ans={};
    int v=1,s=0;
    Rep(i,1,1000){
        rep(j,2){
            ans.push_back(i);
            if(j==1 || v!=i)s++;
            if(j==0 && v==i) v*=2;
            if(s==t){
                if(v<k) ans.push_back(k);
                cout << ans.size() << endl;
                rep(i,ans.size()){
                    cout << ans[i] << " ";
                }
                cout << "" << endl;
            }
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}