#include <bits/stdc++.h>
using namespace std;
void PLAY() {
  cout << fixed << setprecision(10);
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
bool cmp(string &a, string &b) { return a.size() < b.size(); }
bool get(char c) {
  return (c == 'a' || c == 'o' || c == 'u' || c == 'i' || c == 'e' || c == 'y');
}
bool isprime(long long n) {
  if (n == 2) return true;
  if (n % 2 == 0 || n < 2) return false;
  for (int i = 3; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
const long long MOD = 1e18 + 7;
long long poww(long long b, long long p) {
  if (p == 0) return 1;
  long long sq = poww(b, p / 2);
  sq = (sq * sq) % MOD;
  if (p % 2 == 1) {
    sq = (sq * b) % MOD;
  }
  return sq;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  long long f = m;
  vector<long long> ans;
  ans.push_back(m);
  while (m) {
    if (n == m) {
      cout << "YES" << endl;
      sort(ans.begin(), ans.end());
      cout << ans.size() << endl;
      for (auto it : ans) {
        cout << it << " ";
      }
      cout << endl;
      return 0;
    } else if (m < n) {
      cout << "NO" << endl;
      return 0;
    } else if (m % 2 == 0) {
      m /= 2;
      ans.push_back(m);
    } else {
      if (m % 10 != 1) {
        cout << "NO" << endl;
        return 0;
      }
      string x = to_string(m);
      x.erase(x.begin() + x.size() - 1);
      m = stoll(x);
      ans.push_back(m);
    }
  }
  return 0;
}
