#include <bits/stdc++.h>
using namespace std;
int n, k, a[100005];
int main() {
  int i, j;
  scanf("%d%d", &n, &k);
  long long tmp = (long long)(1 + k) * k / 2;
  if (n < tmp) {
    printf("NO");
    return 0;
  }
  int res, t;
  res = n - tmp;
  t = res / k;
  for (i = 0; i < k; ++i) a[i] = i + 1 + t;
  res %= k;
  if (res == 0) {
    printf("YES\n");
    for (i = 0; i < k; ++i) printf("%d ", a[i]);
    return 0;
  }
  for (i = k - 1; i > 0; --i) {
    if (a[i] >= (a[i - 1] << 1)) continue;
    for (j = i; j < k; ++j) {
      t = (a[j - 1] << 1) - a[j];
      if (res <= t) {
        a[j] += res;
        res = 0;
      } else {
        res -= t;
        a[j] += t;
      }
      if (res == 0) break;
    }
    if (res == 0) break;
  }
  if (res)
    printf("NO");
  else {
    printf("YES\n");
    for (i = 0; i < k; ++i) printf("%d ", a[i]);
  }
  return 0;
}
