#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long INF = 4e18 + 10;
long long power(long long a, long long b, long long in_mod) {
  long long ans = 1;
  long long prod = a;
  while (b) {
    if (b % 2) ans = (ans * prod) % in_mod;
    prod = (prod * prod) % in_mod;
    b /= 2;
  }
  return ans;
}
long long mod_inv(long long q, long long in_mod) {
  return power(q, in_mod - 2, in_mod);
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long fact(long long n, long long in_mod) {
  long long f = 1;
  for (long long i = 1; i <= n; i++) f = (f * i) % in_mod;
  return f;
}
long long ncr(long long n, long long r, long long in_mod) {
  return (((fact(n, in_mod) * mod_inv(fact(r, in_mod), in_mod)) % in_mod) *
          mod_inv(fact(n - r, in_mod), in_mod)) %
         in_mod;
}
void solve() {
  long long n, k;
  cin >> n >> k;
  long long a[k + 1];
  if (k == 1) {
    cout << "YES" << '\n';
    cout << n << '\n';
    return;
  }
  if (n < k * (k + 1) / 2) {
    cout << "NO" << '\n';
    return;
  }
  long long t = n - k * (k + 1) / 2;
  long long ad = t / k;
  long long left = t % k;
  for (long long i = 1; i <= k; i++) {
    a[i] = i + ad;
  }
  for (long long i = k; i >= 1; i--) {
    long long sp = a[i] - 2;
    if (left > sp) {
      left -= sp;
      a[i] += sp;
    } else {
      a[i] += left;
      left = 0;
      break;
    }
  }
  if (left > 0) {
    cout << "NO" << '\n';
    return;
  }
  cout << "YES" << '\n';
  for (long long i = 1; i <= k; i++) cout << a[i] << " ";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << fixed << setprecision(10);
  auto clk = clock();
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  long long t = 1;
  for (long long test = 1; test <= t; test++) {
    solve();
  }
  clk = clock() - clk;
  cerr << fixed << setprecision(6)
       << "Time: " << ((long double)clk) / CLOCKS_PER_SEC << "\n";
  return 0;
}
