#include <bits/stdc++.h>
using namespace std;
bool found = false;
long long b, A[10000], n, orig_a;
void bfs(long long a, long long k) {
  if (found) return;
  if (a > b) return;
  if (a == b) {
    found = true;
    n = k;
    a = orig_a;
    cout << "YES" << endl;
    cout << n + 1 << endl;
    cout << a;
    for (int i = 0; i < n; i++) {
      if (A[i] == 1) {
        a = a * 10 + 1;
        cout << " " << a;
      } else if (A[i] == 2) {
        a = a * 2;
        cout << " " << a;
      }
    }
    cout << endl;
    return;
  }
  A[k] = 2;
  bfs(a * 2, k + 1);
  A[k] = 1;
  bfs((a * 10) + 1, k + 1);
}
int main() {
  long long a, c, d, i, j, m;
  string s;
  cin >> a >> b;
  orig_a = a;
  bfs(a, 0);
  if (!found) cout << "NO" << endl;
  return 0;
}
