#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
vector<long long> p;
long long a, b;
void DFS(long long x) {
  if (x > b) return;
  p.push_back(x);
  if (x == b) {
    printf("YES\n");
    printf("%lld\n", (long long)p.size());
    for (int i = 0; i < (int)p.size(); i++)
      printf("%lld%c", p[i], i == (int)p.size() - 1 ? '\n' : ' ');
    exit(0);
  }
  DFS(2 * x);
  DFS(10 * x + 1);
  p.pop_back();
}
int main() {
  scanf("%d%d", &a, &b);
  p.clear();
  DFS(a);
  printf("NO\n");
  return 0;
}
