#include <bits/stdc++.h>
using namespace std;
long long int __xor(long long int a, long long int b) { return a ^ b; }
long long int __and(long long int a, long long int b) { return a & b; }
long long int __or(long long int a, long long int b) { return a | b; }
long long int ai[1000], pi[1000];
int main() {
  long long int b, c, y, z, t, i, j, k = 1, l1, l2, m = 0, n, c1 = 0, c2 = 0,
                                     f = 0, x;
  scanf("%lld", &n);
  scanf("%lld", &y);
  l1 = n;
  vector<long long int> vec;
  queue<long long int> q;
  while (l1 != 0) {
    l2 = l1 % 2;
    l1 = l1 / 2;
    if (l2 == 1) {
      q.push(k);
    }
    k = k * 2;
  }
  if (q.size() > y)
    cout << "NO";
  else if (q.size() == y) {
    cout << "YES\n";
    while (!q.empty()) {
      cout << q.front() << " ";
      q.pop();
    }
  } else {
    while (!q.empty()) {
      if (q.front() > 1) {
        l1 = q.front();
        q.pop();
        q.push(l1 / 2);
        q.push(l1 / 2);
        if (q.size() + vec.size() == y) {
          f = 1;
          break;
        }
      } else {
        vec.push_back(1);
        q.pop();
        if (q.size() + vec.size() == y) {
          f = 1;
          break;
        }
      }
    }
    if (f == 1) {
      cout << "YES\n";
      for (j = 0; j < vec.size(); j++) cout << vec[j] << " ";
      while (!q.empty()) {
        cout << q.front() << " ";
        q.pop();
      }
    } else
      cout << "NO";
  }
  return 0;
}
