#include <iostream>
#include <vector>

using lint = long long;

void solve() {
    int k, x;
    std::cin >> k >> x;

    if (x == 0) {
        std::cout << "Yes\n"
                  << 1 << "\n"
                  << (k == 0 ? 1 : 0) << "\n";
        return;
    }

    if (k == 0) ++x;
    if (__builtin_popcount(x) != 1) {
        std::cout << "No\n";
        return;
    }

    int p = __builtin_ctz(x);

    std::vector<int> ans;
    int b = 0;
    for (int i = 0; i < 20; ++i) {
        if ((~k >> i) & 1) continue;
        ans.push_back(1 << i);
        b |= (1 << i);
    }

    while ((int)ans.size() > 1 &&
           (1 << ((int)ans.size() - 1)) >= p) {
        int a = ans.back();
        ans.pop_back();
        ans.back() |= a;
    }

    {
        int i = 0;
        while ((1 << (int)ans.size()) < p) {
            while ((b >> i) & 1) ++i;
            ans.push_back(1 << i);
            b |= (1 << i);
        }
    }

    {
        for (int q = 0; q < p; ++q) {
            int y = 0;
            for (int j = 0; j < p; ++j) {
                if ((q >> j) & 1) y |= ans[j];
            }
            ans.push_back(y);
        }
    }

    if ((int)ans.size() > 40) {
        std::cout << "No\n";
    } else {
        std::cout << "Yes\n"
                  << ans.size() << "\n";
        for (auto a : ans) std::cout << a << " ";
        std::cout << "\n";
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}