#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
int main() {
  long long n, k;
  cin >> n >> k;
  map<int, int, greater<int> > st;
  long long n1 = n;
  for (int i = 0; n1 > 0; ++i) {
    if (n1 & 1) st[i] = 1;
    n1 >>= 1;
  }
  k -= (int)(st.size());
  if (k < 0) {
    cout << "No\n";
    return 0;
  }
  while (k > 0) {
    auto it = *st.begin();
    if (k >= it.second) {
      st.erase(it.first);
      st[it.first - 1] += it.second * 2;
      k -= it.second;
    } else {
      auto it = *st.rbegin();
      st[it.first] -= 1;
      st[it.first - 1] += 2;
      k -= 1;
      if (st[it.first] == 0) st.erase(it.first);
    }
  }
  cout << "Yes\n";
  for (auto it : st) {
    for (int i = 0; i < (it.second); ++i) cout << it.first << " ";
  }
  cout << "\n";
  return 0;
}
