#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int k, x;
	cin>>k>>x;
	if(x==0){
		cout<<"Yes"<<endl;
		cout<<1<<endl;
		if(k==0) cout<<1<<endl;
		else cout<<0<<endl;
		return 0;
	}
	if(k==0){
		x++;
	}
	int d=0;
	while(x%2==0){
		d++;
		x>>=1;
	}
	if(x>1){
		cout<<"No"<<endl;
		return 0;
	}
	int t=-1;
	for(int i=19; i>=0; i--){
		if(k&(1<<i)){
			t=i; break;
		}
	}
	vector<int> a;
	if(k!=0) a.push_back(k);
	for(int i=0; i<20; i++){
		if(t==i) continue;
		a.push_back(1<<i);
		if(a.size()==5) break;
	}
	for(int i=0; i<d; i++){
		int s=0;
		for(int j=0; j<5; j++){
			if(i&(1<<j)) s^=a[j];
		}
		a.push_back(s);
	}
	cout<<"Yes"<<endl;
	cout<<a.size()<<endl;
	for(auto x:a){
		cout<<x<<" ";
	}
	cout<<endl;
    return 0;
}