#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<long long>;
using vpi = vector<pair<long long, long long>>;
using vvi = vector<vi>;
using tp = tuple<long long, long long, long long>;
using pi = pair<long long, long long>;
const long long nax = 1e5 + 7;
const long long mod = 1e9 + 7;
const long long inf = numeric_limits<long long>::max() - (long long)9e6;
void test() {
  long long n, k;
  cin >> n;
  cin >> k;
  if (k > 1e6) {
    cout << -1;
    return;
  }
  vi d;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i) continue;
    d.push_back(n / i);
    d.push_back(i);
  }
  auto pos = [&](long long div) {
    long long s = div * (k) * (k - 1) / 2;
    if (s < 0) return false;
    return (n - s > (k - 1) * div);
  };
  long long ans = -1;
  for (long long div : d) {
    if (pos(div)) ans = max(ans, div);
  }
  if (ans == -1) {
    cout << -1;
    return;
  }
  for (long long i = 1; i <= k - 1; i++) cout << i * ans << ' ';
  cout << n - ans * (k) * (k - 1) / 2;
}
signed main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  long long T = 1;
  while (T--) {
    test();
    cout << "\n";
  }
  return 0;
}
