#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
long long n, k, a[maxn];
int main() {
  cin >> n >> k;
  priority_queue<int> q;
  for (int i = 62; ~i; --i) {
    if ((1LL << i) & n) q.push(i);
  }
  if ((int)q.size() > k)
    puts("No");
  else {
    while ((int)q.size() < k) {
      q.push(q.top() - 1);
      q.push(q.top() - 1);
      q.pop();
    }
    int MAX = q.top();
    while (!q.empty()) q.pop();
    for (int i = 62; ~i; --i) {
      if ((1LL << i) & n) q.push(i);
    }
    while (q.top() > MAX) {
      q.push(q.top() - 1);
      q.push(q.top() - 1);
      q.pop();
    }
    puts("Yes");
    int num = 0;
    while ((int)q.size() > 1) {
      cout << q.top() << " ";
      q.pop();
      num++;
    }
    int MIN = q.top();
    while (num < k - 1) {
      cout << MIN - 1 << " ";
      MIN -= 1;
      num++;
    }
    cout << MIN;
  }
  return 0;
}
