#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define PI 3.1415926535897932384626433832795028841971
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define mod 1000000007

using namespace std;
typedef pair<llint, llint> P;

llint k, x;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> k >> x;
	
	if(k == 0){
		if(x+1 > (1<<20)){
			cout << "No" << endl;
			return 0;
		}
		if(x == 0){
			cout << "Yes" << endl;
			cout << 1 << endl;
			cout << 1 << endl;
			return 0;
		}
		if((x+1)&x){
			cout << "No" << endl;
			return 0;
		}
		llint r = 0;
		x++;
		for(;x;x/=2) r++;
		r--;
		
		cout << "Yes" << endl;
		cout << 2*r << endl;
		for(int i = 0; i < r; i++){
			cout << (1<<i) << " " << (1<<i) << " ";
		}
		cout << endl;
		return 0;
	}
	
	if(x > (1<<20)){
		cout << "No" << endl;
		return 0;
	}
	if(x == 0){
		cout << "Yes" << endl;
		cout << 1 << endl;
		cout << 0 << endl;
		return 0;
	}
	if((x-1)&x){
		cout << "No" << endl;
		return 0;
	}
	
	llint r = 0;
	for(;x;x/=2) r++;
	r--;
	
	cout << "Yes" << endl;
	cout << min(40LL, 2*r+1) << endl;
	for(int i = 0; i < min(19LL, r); i++){
		if(k&(k-1)) cout << (1<<i) << " " << (1<<i) << " ";
		else cout << (1<<20)-1-(1<<i) << " " << (1<<20)-1-(1<<i) << " ";
	}
	if(r == 20) cout << 0 << " ";
	cout << k << endl;
	cout << endl;
	
	return 0;
}