#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
const int K = 1e5 + 20, inf = 1e9 + 20;
int n, k, a[K];
void err() {
  cout << "NO\n";
  exit(0);
}
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  for (int i = 0; i < k; i++) {
    int mx = min(n, (i ? 2 * a[i - 1] : inf));
    int low = (i ? a[i - 1] : 0), high = mx + 1;
    while (high - low > 1) {
      int mid = (low + high) / 2;
      int rem = k - i - 1;
      if (rem > 30)
        high = mid;
      else if (mid * ((1ll << (rem + 1)) - 1) >= n)
        high = mid;
      else
        low = mid;
    }
    if (high > mx) err();
    n -= high;
    a[i] = high;
    if (n < 0) err();
  }
  cout << "YES\n";
  for (int i = 0; i < k; i++) cout << a[i] << ' ';
  cout << '\n';
}
