#include <bits/stdc++.h>
using namespace std;
void io() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
unordered_map<long long int, bool> umap;
bool found = false;
void dfs(long long int crr, long long int tar, vector<long long int>& path,
         long long int len) {
  long long int n1 = 10 * crr + 1, n2 = 2 * crr;
  if (umap.find(n1) == umap.end() && n1 <= tar) {
    umap[n1] = true;
    path.push_back(n1);
    if (tar == n1) {
      found = true;
      cout << "YES\n";
      cout << path.size() << "\n";
      for (int i = 0; i < (int)path.size(); ++i) {
        cout << path[i] << " ";
      }
      cout << "\n";
      ;
      return;
    }
    dfs(n1, tar, path, len + 1);
    while ((int)path.size() > len) {
      path.pop_back();
    }
  }
  if (umap.find(n2) == umap.end() && n2 <= tar) {
    umap[n2] = true;
    path.push_back(n2);
    if (tar == n2) {
      found = true;
      cout << "YES\n";
      cout << path.size() << "\n";
      for (int i = 0; i < (int)path.size(); ++i) {
        cout << path[i] << " ";
      }
      cout << "\n";
      ;
      return;
    }
    dfs(n2, tar, path, len + 1);
  }
}
void Solve() {
  long long int a, b;
  cin >> a >> b;
  vector<long long int> temp = {a};
  dfs(a, b, temp, 1);
  if (!found) {
    cout << "NO";
    cout << "\n";
    ;
  }
}
int main() {
  io();
  long long int t;
  t = 1;
  for (int i = 0; i < t; ++i) {
    Solve();
  }
  return 0;
}
