#include <bits/stdc++.h>
using namespace std;
map<int, int> s;
int main() {
  long long n;
  int k;
  cin >> n >> k;
  int cnt = 0;
  for (int i = 0; i <= 63; i++) {
    if ((n >> i) & 1) {
      s[i]++;
      cnt++;
    }
  }
  if (cnt > k) {
    cout << "No\n";
    return 0;
  }
  for (int i = 63; i >= -63; i--) {
    if (cnt + s[i] <= k) {
      cnt += s[i];
      s[i - 1] += s[i] * 2;
      s[i] = 0;
    } else
      break;
  }
  cout << "Yes\n";
  multiset<int> ms;
  for (int i = 63; i >= -63; i--) {
    for (int j = 1; j <= s[i]; j++) {
      ms.insert(i);
    }
  }
  while (ms.size() < k) {
    int u = *ms.begin();
    ms.erase(ms.begin());
    ms.insert(u - 1);
    ms.insert(u - 1);
  }
  for (multiset<int>::reverse_iterator it = ms.rbegin(); it != ms.rend(); it++)
    cout << *it << " ";
  cout << "\n";
  return 0;
}
