#include <bits/stdc++.h>
using namespace std;
long long n, k, n2, n3;
long long a[100009];
int main() {
  scanf("%lld%lld", &n, &k);
  n3 = n;
  if (n < (k) * (k + 1) / 2) {
    printf("NO");
    return 0;
  }
  n2 = n - (k - 1) * k / 2;
  a[0] = n2 / k;
  for (int i = 1; i < k; i++) a[i] = a[i - 1] + 1;
  n -= (a[0] * k + (k) * (k - 1) / 2);
  if (n > 0) {
    for (int i = k - 1; i >= 0; i--) {
      long long t2 = min(a[i - 1] * 2 - a[i], n);
      if (t2 > 0) {
        a[i] += t2;
        n -= t2;
        if (n == 0) break;
      } else
        break;
    }
  }
  n2 = 0;
  for (int i = 0; i < k; i++) n2 += a[i];
  if (n2 != n3) {
    printf("NO");
    return 0;
  }
  printf("YES\n");
  for (int i = 0; i < k; i++) printf("%lld ", a[i]);
}
