#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long exp(long long x, long long y) {
  x %= 1000000007;
  long long res = 1;
  while (y) {
    if (y & 1) res = res * x % 1000000007;
    x = x * x % 1000000007;
    y >>= 1;
  }
  return res;
}
long long fact(long long n) {
  long long res = 1;
  for (long long i = 2; i <= n; i = i + 1) (res *= i) %= 1000000007;
  return res;
}
bool isprime(long long n) {
  if (n <= 1) return 0;
  for (long long i = 2; i * i <= n; ++i)
    if (n % i == 0) return 0;
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long n, k;
  cin >> n >> k;
  if (n < k * (k + 1) / 2) {
    cout << "NO";
    return 0;
  }
  vector<int> ans(k);
  iota(ans.begin(), ans.end(), 1);
  n -= k * (k + 1) / 2;
  for (int i = 0; i < k; ++i) ans[i] += n / k;
  n %= k;
  for (int i = k - 1; i >= k - n; --i) {
    ans[i] += 1;
  }
  if (k > 1 && ans[1] > 2 * ans[0]) {
    ans[1] -= 1;
    ans[k - 1] += 1;
  }
  for (int i = 1; i < k; ++i) {
    if (ans[i] > 2 * ans[i - 1] || ans[i] <= ans[i - 1]) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  for (auto c : ans) cout << c << " ";
  return 0;
}
