#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long powmod(long long a, long long b, long long MOD) {
  long long ans = 1;
  while (b) {
    if (b % 2) ans = ans * a % MOD;
    a = a * a % MOD;
    b /= 2;
  }
  return ans;
}
const int N = 2e5 + 11;
long long n, k, sum, a[N];
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> k;
  if (k == 1) {
    return cout << "YES\n" << n, 0;
  }
  for (int i = 1; i <= k; i++) a[i] = i, sum += i, n -= i;
  if (n < 0) return cout << "NO\n", 0;
  for (int i = 1; i <= k; i++) a[i] += n / k;
  n %= k;
  long long now = k;
  while (n && now >= 1) {
    long long dis;
    if (now > 1)
      dis = 2 * a[now - 1] - a[now];
    else
      dis = a[2] - 1 - a[1];
    if (dis <= 0) {
      now--;
      continue;
    }
    dis = min(dis, n);
    a[now] += dis;
    n -= dis;
    if (now == k)
      now--;
    else
      now++;
  }
  if (!n) {
    cout << "YES\n";
    for (int i = 1; i <= k; i++) cout << a[i] << ' ';
  } else
    cout << "NO\n";
  return 0;
}
