#include <bits/stdc++.h>
using namespace std;
const int mx = 2e5 + 5;
long long n, s[mx], cnt, k;
void bepok() {
  cout << "NO" << endl;
  exit(0);
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  if (n < (k * (k + 1) / 2) || (k == 2 && n == 4) || (k == 3 && n == 8))
    bepok();
  cout << "YES" << endl;
  long long sum = (n - k * (k + 1) / 2) / k;
  for (int i = 1; i <= k; i++) s[i] += sum + i, cnt += s[i];
  s[k] += n - cnt;
  if (k > 1 && s[k] > s[k - 1] * 2) s[k]--, s[k - 1]++;
  for (int i = 1; i <= k; i++) cout << s[i] << " ";
  return 0;
}
