#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, OO = 0x3f3f3f3f;
int n, k, pow2[N];
void _run() {
  scanf("%d %d", &n, &k);
  pow2[0] = 1;
  for (int i = 1; i <= 31; ++i) pow2[i] = pow2[i - 1] * 2;
  int idx = upper_bound(pow2, pow2 + 32, n) - pow2;
  --idx;
  while (idx >= 0) {
    int tmpRkm = n, tmpK = k, tmpIdx = idx;
    vector<int> ans;
    while (tmpRkm != 0 && tmpK && tmpIdx > -1) {
      if (tmpRkm - pow2[tmpIdx] >= 0 && tmpRkm - pow2[tmpIdx] >= tmpK - 1) {
        ans.push_back(pow2[tmpIdx]);
        tmpRkm -= pow2[tmpIdx];
        tmpK--;
      } else
        tmpIdx--;
    }
    if (tmpRkm == 0 && tmpK == 0) {
      puts("YES");
      for (auto x : ans) printf("%d ", x);
      return;
    }
    idx--;
  }
  puts("NO");
}
int main() {
  int tc = 1;
  while (tc--) _run();
  return 0;
}
