#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5 + 7;
long long n, k;
long long a[N];
int main() {
  cin >> n >> k;
  n -= (k * 1LL * (k + 1) / 2);
  if (n < 0) {
    cout << "NO";
    return 0;
  }
  for (int i = 1; i <= k; i++) {
    a[i] = i + n / k;
  }
  n %= k;
  for (int i = k; i > 1 && n > 0; i--) {
    if (a[i] + 1 <= a[i - 1] * 2) {
      a[i]++;
      n--;
    }
  }
  while (n > 0 && a[k] + 1 <= a[k - 1] * 2) {
    a[k]++;
    n--;
  }
  if (n > 0) {
    puts("NO");
    return 0;
  }
  puts("YES");
  for (int i = 1; i <= k; i++) {
    printf("%lld ", a[i]);
  }
}
