#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  priority_queue<int> maxh;
  int c = 0;
  if (k > n)
    cout << "NO";
  else {
    int j = 0;
    while (n >= (1 << j)) {
      if (n & (1 << j)) {
        c++;
        maxh.push(1 << j);
      }
      j++;
    }
    if (k < c)
      cout << "NO";
    else {
      cout << "YES\n";
      while (c < k) {
        int a = maxh.top();
        maxh.pop();
        maxh.push(a / 2);
        maxh.push(a / 2);
        c++;
      }
      while (maxh.size() != 0) {
        cout << maxh.top() << " ";
        maxh.pop();
      }
    }
  }
  cout << "\n";
}
