#include <bits/stdc++.h>
const int N = 1e6 + 10;
const int mod = 998244353;
using namespace std;
int a[N];
int cal(int n, int k) {
  long long t = n - 1LL * (k - 1) * k / 2, u = t / k;
  return u;
}
int main() {
  long long n, k;
  cin >> n >> k;
  long long d, u;
  if (k > 30)
    d = 1;
  else {
    long long t = (1 << k) - 1;
    if (n % t)
      d = n / t + 1;
    else
      d = n / t;
  }
  long long t = n - 1LL * (k - 1) * k / 2;
  u = t / k;
  if (d > u) return cout << "NO" << endl, 0;
  cout << "YES" << endl;
  int s = n;
  a[1] = u, s -= u;
  for (int i = 2; i < k; ++i)
    a[i] = min(2 * a[i - 1], cal(s, k - i + 1)), s -= a[i];
  if (k > 1) a[k] = s;
  for (int i = 1; i <= k; ++i) cout << a[i] << " ";
  return 0;
}
