#include <bits/stdc++.h>
using namespace std;
long long a[110000];
long long s(long long m) { return m * (m + 1) / 2; }
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= k; i++) {
    long long ans =
        max((int)(a[i - 1] + 1),
            (int)ceil((double)n / (double)(pow(2.0, k + 1 - i) - 1)));
    if (s(ans - i + k) - s(ans - 1) > n) {
      cout << "NO" << endl;
      return 0;
    }
    a[i] = ans;
    n -= ans;
  }
  cout << "YES" << endl;
  for (int i = 1; i <= k; i++) {
    cout << a[i] << " ";
  }
  return 0;
}
