#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}


void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll K,X;
	cin>>K>>X;
	if(K==0) X++;
	int c=0;
	while(X%2==0) X/=2,c++;
	if(X!=1){
		yneos(0);
		return;
	}
	yneos(1);
	if(c==0){
		cout<<"1\n"<<abs(K-1)<<"\n";
		return;
	}
	vector<int> ans;
	if(K!=0){
		ans.push_back(K);
	}
	int ind=1,D;
	while(ans.size()!=8){
		D=ind;
		rep(i,ans.size()){
			if((D^ans[i])<D) D^=ans[i];
		}
		if(D!=0){
			ans.push_back(D);
		}
		ind++;
	}
	rep(i,c){
		ans.push_back(i);
	}
	cout<<ans.size()<<"\n";
	rep(i,ans.size()){
		if(i) cout<<" ";
		cout<<ans[i];
	}
	cout<<"\n";
}