#include <bits/stdc++.h>
const int N = 2e5;
using namespace std;
long long ans[N];
int main() {
  long long i, j, k, n, m, sum;
  scanf("%lld%lld", &n, &k);
  sum = (1 + k) * k / 2;
  if (sum > n) {
    printf("NO\n");
  } else {
    for (i = 1; i <= k; i++) ans[i] = i;
    m = n - sum;
    for (i = 1; i <= k; i++) ans[i] += m / k;
    m %= k;
    for (i = k; i > 1; i--) {
      if (m == 0) break;
      long long dx = min(m, 2 * ans[i - 1] - ans[i]);
      ans[i] += dx;
      m -= dx;
    }
    if (m > 0)
      printf("NO\n");
    else {
      printf("YES\n");
      for (i = 1; i <= k; i++) printf("%lld ", ans[i]);
    }
  }
}
