#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
long long n, k;
priority_queue<long long> q;
int main() {
  cin >> n >> k;
  for (int i = 0; i <= 31; i++) {
    if ((n >> i) & 1) q.push(n & (1 << i));
  }
  if (q.size() > k) {
    cout << "NO";
    return 0;
  }
  while (q.size() < k) {
    if (q.top() == 1) break;
    long long x = q.top();
    q.pop();
    q.push(x / 2);
    q.push(x / 2);
  }
  if (q.size() < k)
    cout << "NO";
  else {
    cout << "YES" << endl;
    while (!q.empty()) {
      cout << q.top() << ' ';
      q.pop();
    }
  }
  return 0;
}
