#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
int v[maxn], ans[maxn];
int main() {
  long long n, k;
  int flag;
  cin >> n >> k;
  int index = 0;
  int cnt = 0;
  while (n) {
    if (n % 2 == 1) cnt++;
    v[index++] = n % 2;
    n /= 2;
  }
  if (cnt > k) {
    cout << "No" << endl;
    return 0;
  }
  for (int i = 0; i < index; i++) {
    ans[i] = v[index - i - 1];
    if (ans[i]) flag = i;
  }
  for (int i = 0; cnt != k; i++) {
    if (k - cnt >= ans[i]) {
      cnt += ans[i];
      ans[i + 1] += ans[i] * 2;
      ans[i] = 0;
    } else
      break;
    if (i + 1 > flag) flag = i + 1;
  }
  while (cnt != k) {
    cnt++;
    ans[flag]--;
    ans[flag + 1] += 2;
    flag++;
  }
  int now;
  cout << "Yes" << endl;
  for (int i = 0; i <= flag; i++) {
    while (ans[i]) {
      ans[i]--;
      now = index - 1 - i;
      cout << now << " ";
    }
  }
}
