#include <bits/stdc++.h>
using namespace std;
int n, k, cur;
priority_queue<int> pq;
int main() {
  scanf("%d %d", &n, &k);
  cur = 1;
  while (n) {
    if (n % 2 == 1) {
      pq.push(cur);
    }
    n /= 2;
    cur *= 2;
  }
  if (pq.size() > k)
    printf("NO\n");
  else {
    while (k > pq.size()) {
      int now = pq.top();
      if (now == 1) {
        printf("NO\n");
        return 0;
      }
      pq.pop();
      pq.push(now / 2);
      pq.push(now / 2);
    }
    printf("YES\n");
    while (!pq.empty()) {
      int now = pq.top();
      printf("%d", now);
      pq.pop();
      if (pq.empty())
        printf("\n");
      else
        printf(" ");
    }
  }
}
