#include <bits/stdc++.h>
using namespace std;
long long a[100005];
int main() {
  long long n, k;
  cin >> n >> k;
  long long sum = 0;
  long long begin = max((long long)1, (2 * n / k - k + 1) / 2);
  while ((begin + begin + k - 1) * k / 2 <= n) {
    begin++;
  }
  begin--;
  if (begin == 0) {
    cout << "NO" << '\n';
    return 0;
  }
  for (int i = 0; i < k; i++) {
    if (i == 0)
      a[i] = begin;
    else
      a[i] = a[i - 1] + 1;
    sum += a[i];
  }
  if (sum > n) {
    cout << "NO" << '\n';
    return 0;
  }
  for (int i = k - 1; i > 0; i--) {
    int gap = n - sum;
    int temp = a[i - 1] * 2 - a[i];
    if (temp < gap) {
      a[i] += temp;
      sum += temp;
    } else {
      a[i] += gap;
      sum = n;
      break;
    }
  }
  if (sum != n) {
    cout << "NO" << '\n';
    return 0;
  }
  cout << "YES" << '\n';
  for (int i = 0; i < k; i++) {
    cout << a[i];
    if (i == k - 1)
      cout << '\n';
    else
      cout << ' ';
  }
  return 0;
}
