#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  priority_queue<long long> q;
  priority_queue<long long> q2;
  long long pos = 0;
  while (n > 0) {
    if (n % 2 == 1) {
      q.push(pos);
      q2.push(pos);
    }
    pos++;
    n /= 2;
  }
  if (q.size() > k) {
    cout << "No" << endl;
    return 0;
  }
  while (q.size() < k) {
    long long digit = q.top();
    q.pop();
    digit--;
    q.push(digit);
    q.push(digit);
  }
  long long y = q.top();
  while (q2.top() > y) {
    long long digit = q2.top();
    q2.pop();
    digit--;
    q2.push(digit);
    q2.push(digit);
  }
  vector<long long> r;
  while (!q2.empty()) {
    r.push_back(q2.top());
    q2.pop();
  }
  while (r.size() < k) {
    long long digit = r[r.size() - 1];
    r.pop_back();
    digit--;
    r.push_back(digit);
    r.push_back(digit);
  }
  cout << "Yes" << endl;
  for (int i = 0; i < r.size(); i++) {
    cout << r[i] << " ";
  }
  return 0;
}
