#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
const ll mod = 1000000007;
const ll INF = 1000000099;
const ll LINF = (ll)(1e18 + 99);
vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
template <typename T, typename U>
void chmin(T& t, const U& u) {
  if (t > u) t = u;
}
template <typename T, typename U>
void chmax(T& t, const U& u) {
  if (t < u) t = u;
}
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
T mpow(T a, T n) {
  T res = 1;
  for (; n; n >>= 1) {
    if (n & 1) res = res * a;
    a = a * a;
  }
  return res;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n, k;
  cin >> n >> k;
  if (__builtin_popcount(n) > k || n < k) {
    cout << "NO" << endl;
    return 0;
  } else {
    cout << "YES" << endl;
    k -= __builtin_popcount(n);
  }
  ll exp = 0;
  queue<ll> q;
  while (n > 0) {
    if (n % 2) q.push(mpow(2ll, exp));
    exp++;
    n >>= 1;
  }
  while (q.size()) {
    ll now = q.front();
    q.pop();
    if (k > 0 && now > 1) {
      q.push(now / 2);
      q.push(now / 2);
      k--;
    } else {
      cout << now << " ";
    }
  }
}
