#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
long long n, k;
vector<long long> ans;
vector<int> bit;
void Get(int x) {
  while (x) bit.push_back(x % 2), x /= 2;
}
int main() {
  cin >> n >> k;
  Get(n);
  if (k > n || k < count(bit.begin(), bit.end(), 1)) return puts("NO");
  for (int i = 0; i < bit.size(); ++i) {
    if (bit[i]) ans.push_back(1ll << i);
  }
  for (int i = 0; i < ans.size(); ++i) {
    if (ans.size() == k) break;
    while (ans[i] > 1) {
      if (ans.size() == k) break;
      ans.push_back(ans[i] / 2);
      ans[i] /= 2;
    }
  }
  sort(ans.begin(), ans.end());
  puts("YES");
  for (auto i : ans) cout << i << " ";
  return 0;
}
