#include <bits/stdc++.h>
using namespace std;
const int dr[] = {-1, 1, 0, 0};
const int dc[] = {0, 0, -1, 1};
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int kr[] = {1, 1, -1, -1, 2, 2, -2, -2};
const int kc[] = {2, -2, 2, -2, 1, -1, 1, -1};
template <class T1>
void deb(T1 e1) {
  cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
const int res = 1e5 + 10;
long long int a, b;
vector<long long int> v;
bool dfs(long long int x) {
  if (x > b) return false;
  if (x == b) {
    v.push_back(b);
    return true;
  }
  if (dfs(2 * x)) {
    v.push_back(x);
    return true;
  }
  if (dfs(x * 10 + 1)) {
    v.push_back(x);
    return true;
  }
  return false;
}
int main() {
  scanf("%I64d %I64d", &a, &b);
  if (dfs(a)) {
    deb("YES");
    deb(v.size());
    sort((v).begin(), (v).end());
    for (auto it : v) {
      cout << it << " ";
    }
    cout << endl;
  } else {
    cout << "NO\n";
  }
  return 0;
}
