//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head

int k, x;
vi ans;

int bit[20];
bool add(int x) {
	if(!x) return false;
	rep(i, 20) if((x^bit[i]) < x) {
		x ^= bit[i];
	}
	if(!x) return false;
	rep(i, 20) if((x^bit[i]) < bit[i]) {
		bit[i] ^= x;
	}
	bit[31-__builtin_clz(x)] = x;
	return true;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> k >> x;
	if(!x) {
		cout << "Yes\n1\n" << !k << '\n';
		return 0;
	}
	if(!k) x++;
	if(__builtin_popcount(x) != 1) {
		cout << "No\n";
		return 0;
	}
	cout << "Yes\n";
	if(!k) {
		int now = 0;
		int z = 1;
		while(true) {
			rep(i, 2) {
				if(!add(now)) z <<= 1;
				ans.push_back(now);
				if(z == x) {
					cout << ans.size() << endl;
					rep(i, ans.size()) {
						cout << ans[i] << (i == ans.size()-1?'\n':' ');
					}
					return 0;
				}
			}
			now++;
		}
	}
	else {
		int now = 0;
		int z = 1;
		ans.push_back(k);
		add(k);
		if(x == 1) {
			cout << "1\n" << ans[0] << endl;
			return 0;
		}
		while(true) {
			if(!add(now)) z <<= 1;
			ans.push_back(now);
			if(z == x) {
				cout << ans.size() << endl;
				rep(i, ans.size()) {
					cout << ans[i] << (i == ans.size()-1?'\n':' ');
				}
				return 0;
			}
			now++;
		}
	}
}