#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  long long n, k, m = 0;
  cin >> n >> k;
  priority_queue<long long, vector<long long>, greater<long long>> q;
  map<long long, long long> cnt;
  for (long long i = 0; i < 64; ++i) {
    if (n & (1LL << i)) ++m, ++cnt[i];
  }
  if (m > k) {
    cout << "No\n";
    return 0;
  }
  for (long long i = 63; i >= -63; --i) {
    if (m + cnt[i] <= k)
      m += cnt[i], cnt[i - 1] += cnt[i] * 2, cnt[i] = 0;
    else
      break;
  }
  cout << "Yes\n";
  for (long long i = 63; i >= -63; --i)
    for (long long j = 0; j < cnt[i]; ++j) q.push(i);
  while (q.size() < k) {
    long long v = q.top();
    q.pop();
    q.push(v - 1);
    q.push(v - 1);
  }
  vector<long long> ans;
  while (q.size()) {
    ans.push_back(q.top());
    q.pop();
  }
  reverse(ans.begin(), ans.end());
  for (auto i : ans) cout << i << " ";
  cout << "\n";
}
