#include <bits/stdc++.h>
using namespace std;
int modpow(int x, int n) {
  if (n == 0) return 1;
  long long u = modpow(x, n / 2);
  u = (u * u);
  if (n % 2 == 1) u = (u * x);
  return u;
}
const int N = int(1e5) + 10;
const int K = 11;
const int MOD = int(1e9) + 7;
const int INF = int(2e9) + 5;
const long long INF64 = 1e18;
int a[N];
void solve() {
  long long n, k;
  cin >> n >> k;
  if (k == 1) {
    cout << "YES" << endl;
    cout << n;
    return;
  }
  if (n < (k * (k + 1)) / 2) {
    cout << "NO" << endl;
    return;
  }
  for (int i = 1; i <= k; i++) {
    a[i] = i;
    n -= i;
  }
  if (n < 0) {
    cout << "NO" << endl;
    return;
  }
  int ex = n / k;
  for (int i = 1; i <= k; i++) a[i] += ex;
  int rem = n % k;
  for (int j = k; j > 0; j--) {
    int t = min(2 * a[j - 1] - a[j], rem);
    a[j] += t;
    rem -= t;
    if (rem == 0) {
      cout << "YES" << endl;
      for (int i = 1; i <= k; i++) cout << a[i] << " ";
      return;
    }
  }
  cout << "NO";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}
