#include <bits/stdc++.h>
using namespace std;
vector<long long> path;
void createGraph(long long a, long long b,
                 map<long long, vector<long long> > &g) {
  long long t1, t2;
  t1 = 2 * a;
  t2 = 10 * a + 1;
  if (t1 > b && t2 > b) return;
  if (t1 <= b) {
    g[a].push_back(t1);
    createGraph(t1, b, g);
  }
  if (t2 <= b) {
    g[a].push_back(t2);
    createGraph(t2, b, g);
  }
}
bool dfs(long long a, long long b, map<long long, vector<long long> > &g,
         map<long long, bool> &vis) {
  if (a == b) {
    path.push_back(a);
    return 1;
  }
  vis[a] = 1;
  for (auto kid : g[a])
    if (!vis[kid])
      if (dfs(kid, b, g, vis)) {
        path.push_back(a);
        return 1;
      }
  return 0;
}
void solve() {
  long long a, b;
  cin >> a >> b;
  map<long long, vector<long long> > g;
  map<long long, bool> vis;
  createGraph(a, b, g);
  bool ok = dfs(a, b, g, vis);
  if (!ok)
    cout << "NO";
  else {
    cout << "YES\n";
    reverse(path.begin(), path.end());
    cout << path.size() << "\n";
    for (auto i : path) cout << i << " ";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int tc = 1;
  while (tc--) solve();
  return 0;
}
