#include <bits/stdc++.h>
using namespace std;
const long long mx = 2e5 + 5;
long long n, s[mx], cnt, k;
void bepok() {
  cout << "NO" << endl;
  exit(0);
}
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  if (n < (k * (k + 1) / 2)) {
    bepok();
  }
  if (k == 2 && n == 4) {
    bepok();
  }
  if (k == 3 && n == 8) {
    bepok();
  }
  cout << "YES" << endl;
  if (k == 1) {
    cout << n << endl;
    return 0;
  }
  for (long long i = 1; i <= k; i++) {
    s[i] = i;
  }
  long long sum = n - k * (k + 1) / 2;
  sum /= k;
  for (long long i = 1; i <= k; i++) {
    s[i] += sum;
    cnt += s[i];
  }
  s[k] += n - cnt;
  if (s[k] > s[k - 1] * 2) {
    s[k]--;
    s[k - 1]++;
  }
  for (long long i = 1; i <= k; i++) {
    cout << s[i] << " ";
  }
  return 0;
}
