#include <bits/stdc++.h>
using namespace std;
template <class e, class t, int N>
std::basic_istream<e, t>& operator>>(std::basic_istream<e, t>& in,
                                     const e (&literal)[N]) {
  std::array<e, N - 1> buffer;
  in >> buffer[0];
  if (N > 2) in.read(&buffer[1], N - 2);
  if (strncmp(&buffer[0], literal, N - 1))
    in.setstate(in.rdstate() | std::ios::badbit);
  return in;
}
template <class e, class t>
std::basic_istream<e, t>& operator>>(std::basic_istream<e, t>& in,
                                     const e& literal) {
  e buffer;
  in >> buffer;
  if (buffer != literal) in.setstate(in.rdstate() | std::ios::badbit);
  return in;
}
template <class e, class t, int N>
std::basic_istream<e, t>& operator>>(std::basic_istream<e, t>& in,
                                     e (&carray)[N]) {
  return std::operator>>(in, carray);
}
template <class t>
ostream& operator<<(ostream& out, vector<t>& a) {
  for (auto x : a) {
    out << x << " ";
  }
  return out;
}
template <class t1, class t2>
ostream& operator<<(ostream& out, const pair<t1, t2>& a) {
  out << a.first << " " << a.second;
  return out;
}
template <class t1, class t2>
pair<t1, t2> operator+(const pair<t2, t1>& a, const pair<t1, t2>& b) {
  return {a.first + b.first, a.second + b.second};
}
template <class t1, class t2>
pair<t1, t2> operator-(const pair<t2, t1>& a, const pair<t1, t2>& b) {
  return {a.first - b.first, a.second - b.second};
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
long long fpow(long long b, long long e, long long m = (long long)(1e9 + 7)) {
  if (!e) return 1;
  long long q = fpow(b, e / 2, m);
  q = (q * q) % m;
  return e & 1 ? (b * q) % m : q;
}
int32_t main(int32_t argc, char const* argv[]) {
  0;
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, k;
  cin >> n >> k;
  long long nn = n;
  long long kk = (k) * (k + 1) / 2;
  if (n - kk < 0) {
    cout << "NO"
         << "\n";
    return 0;
  }
  if (k == 1) {
    cout << "YES"
         << "\n";
    cout << nn << "\n";
    return 0;
  }
  n -= kk;
  long long c = 0;
  while (n - k >= 0) {
    n -= k;
    c++;
  }
  long long res[k];
  long long j = k - 1;
  for (long long i = 0; i < k; i++) {
    res[i] = i + c + 1;
  }
  while (j >= 1 && n) {
    long long x = min(abs(res[j] - res[j - 1] * 2), n);
    n -= x;
    res[j] += x;
    j--;
  }
  c = 0;
  for (long long i = 0; i < k; i++) c += res[i];
  if (c != nn) {
    cout << "NO"
         << "\n";
    return 0;
  }
  cout << "YES"
       << "\n";
  for (long long i = 0; i < k; i++) cout << res[i] << " ";
  cout << "\n";
  0;
  return 0;
}
