#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  long long cur = 0;
  map<long long, long long> cnt;
  cur = 0;
  while (n) {
    if (n & 1) {
      cnt[cur] = 1;
      k--;
    }
    cur++;
    n >>= 1;
  }
  if (k < 0) {
    cout << "No";
    return 0;
  }
  cur--;
  while (k >= cnt[cur]) {
    k -= cnt[cur];
    cnt[cur - 1] += cnt[cur] * 2;
    cnt[cur] = 0;
    cur--;
  }
  cur = cnt.begin()->first;
  while (k) {
    cnt[cur] -= 1;
    k--;
    cnt[cur - 1] += 2;
    cur--;
  }
  vector<long long> ans;
  for (auto v : cnt) {
    for (int i = 0; i < v.second; i++) ans.push_back(v.first);
  }
  reverse(ans.begin(), ans.end());
  cout << "Yes\n";
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  return 0;
}
