#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e6;
long long n, m;
map<int, int> vis;
int main() {
  cin >> n >> m;
  vis.clear();
  int sum = 0;
  int i = 0;
  while (n > 0) {
    if (n & 1) {
      vis[i]++;
      sum++;
    }
    i++;
    n >>= 1;
  }
  if (sum > m) {
    printf("No\n");
    return 0;
  } else {
    printf("Yes\n");
    multiset<int> ms;
    for (int j = i; j >= -63; j--) {
      if (sum + vis[j] <= m) {
        sum += vis[j];
        vis[j - 1] += 2 * vis[j];
        vis[j] = 0;
      } else
        break;
    }
    for (int k = i; k >= -63; k--) {
      for (int j = 0; j < vis[k]; j++) ms.insert(k);
    }
    int y = ms.size();
    while (y < m) {
      int t = *ms.begin();
      ms.erase(ms.begin());
      ms.insert(t - 1);
      ms.insert(t - 1);
      y++;
    }
    for (auto it = ms.rbegin(); it != ms.rend(); it++) printf("%d ", *it);
    printf("\n");
  }
  return 0;
}
