#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, k;
  cin >> n >> k;
  if (k > 10e6) {
    cout << -1 << endl;
    return 0;
  }
  long long int sum = (k * (k + 1)) / 2;
  if (sum > n || sum < 0) {
    cout << -1 << endl;
    return 0;
  }
  vector<long long int> div;
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      div.push_back(i);
      if (i * i != n) div.push_back(n / i);
    }
  }
  sort(div.begin(), div.end());
  long long int d, c;
  c = 0;
  d = 0;
  bool fla = false;
  for (int i = div.size() - 1; i >= 0; i--) {
    c = n / div[i];
    if (sum > c) continue;
    d = div[i];
    fla = true;
    break;
  }
  if (!fla) {
    cout << -1 << endl;
    return 0;
  }
  for (long long int i = 1; i < k; i++) cout << d * i << " ";
  cout << d * (c - (sum - k));
  cout << endl;
  return 0;
}
