#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e6 + 9;
long long n, k;
long long a[maxn];
int main() {
  cin >> n >> k;
  long long ret(0);
  for (long long i = 1; i <= k; ++i) a[i] = i, ret += a[i];
  if (ret > n) {
    puts("NO");
    return 0;
  }
  long long tmp(n - ret);
  if (tmp >= k) {
    long long lun(tmp / k);
    for (long long i = 1; i <= k; ++i) a[i] += lun;
    ret += lun * k;
  }
  long long up(0);
  while (true) {
    tmp = n - ret;
    if (!tmp) break;
    long long now(std::max(k - tmp + 1, up));
    if (a[now - 1] * 2 < a[now] + 1) {
      long long f(0);
      for (long long j = now + 1; j <= k; ++j) {
        if (a[j - 1] * 2 >= a[j] + 1) {
          f = j;
          break;
        }
      }
      if (!f) {
        puts("NO");
        return 0;
      }
      up = f;
      for (long long j = f; j <= k; ++j) ++a[j];
      ret += k - f + 1;
    } else {
      for (long long i = now; i <= k; ++i) ++a[i];
      ret += k - now + 1;
    }
  }
  puts("YES");
  for (long long i = 1; i <= k; ++i) cout << a[i] << ' ';
  return 0;
}
