#include <bits/stdc++.h>
const long long mod = 1000000007ll, inf = 1e9, linf = 1e18;
using namespace std;
long long n, k;
long long t;
long long ans[1024100];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= k; i++) {
    long long p = k - i + 1;
    long long s = p * (p - 1) / 2;
    ans[i] = (n - s) / p;
    if (i > 1) ans[i] = min(ans[i], ans[i - 1] * 2);
    if (ans[i] <= 0) {
      cout << "NO";
      return 0;
    }
    n -= ans[i];
    if (n < 0) {
      cout << "NO";
      return 0;
    }
  }
  if (n > 0) {
    cout << "NO";
    return 0;
  }
  cout << "YES\n";
  for (int i = 1; i <= k; i++) {
    cout << ans[i] << ' ';
  }
}
