#include <bits/stdc++.h>
using namespace std;
long long md = 99999999;
vector<long long> v;
map<long long, long long> mp;
int dfs(long long a, long long b) {
  if (a == b) return 1;
  if (a > b) return md;
  long long m = 1 + dfs(a * 2, b);
  long long n = 1 + dfs(a * 10 + 1, b);
  if (m < md) v.push_back(a * 2);
  if (n < md) v.push_back(a * 10 + 1);
  return min(m, n);
}
int main() {
  long long a, b;
  cin >> a >> b;
  long long t = dfs(a, b);
  if (t >= md) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
    cout << t << endl;
    v.push_back(a);
    for (int i = v.size() - 1; i >= 0; i--) cout << v[i] << " ";
    cout << endl;
  }
  return 0;
}
