#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  if (k > 1e6) {
    cout << -1 << endl;
    return 0;
  } else if (k * (k + 1) / 2 > n) {
    cout << -1 << endl;
    return 0;
  }
  unordered_set<long long> factors;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      factors.insert(i);
      factors.insert(n / i);
    }
  }
  long long maxD = -1;
  for (auto i : factors) {
    long long sum = (k) * (k - 1) * i / 2;
    if (n >= sum && (k - 1) * i <= n && n - sum > (k - 1) * i) {
      maxD = max(i, maxD);
    }
  }
  if (maxD == -1) {
    cout << -1 << endl;
  } else {
    for (int i = 1; i <= k - 1; i++) {
      cout << i * maxD << " ";
    }
    cout << n - (k - 1) * k * maxD / 2 << endl;
  }
  return 0;
}
