#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  priority_queue<int> q;
  for (int i = 0; i < 32; i++) {
    if (n & (1 << i)) {
      q.push(i);
    }
  }
  if (q.size() > k) {
    cout << "NO\n";
  } else {
    while (q.size() != k) {
      int f = q.top();
      q.pop();
      if (f == 0) {
        cout << "NO\n";
        return 0;
      }
      q.push(f - 1);
      q.push(f - 1);
    }
    cout << "YES\n";
    while (!q.empty()) {
      int val = 1 << q.top();
      cout << val << " ";
      q.pop();
    }
  }
  return 0;
}
