#include <bits/stdc++.h>
using namespace std;
long long power(long long n) {
  long long prod = 1;
  for (long long i = 1; i <= n; i++) prod *= 2;
  return prod;
}
int main() {
  long long n, k, cnt = 0, cnt1 = 0, sum = 0;
  cin >> n >> k;
  queue<long long> q;
  long long temp = n;
  while (n) {
    if (n & 1) {
      q.push(power(cnt1));
      cnt++;
    }
    cnt1++;
    n = n >> 1;
  }
  if (k < cnt) {
    cout << "NO\n";
  } else if (k > temp) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
    while (k != cnt) {
      long long num = q.front();
      q.pop();
      if (num == 1)
        q.push(num);
      else {
        q.push(num / 2);
        q.push(num / 2);
        cnt++;
      }
    }
    while (!q.empty()) {
      cout << q.front() << " ";
      q.pop();
    }
  }
  return 0;
}
