#include <bits/stdc++.h>
using namespace std;
long long n, k, f = 0;
long long solve(long long g) {
  f = 1;
  for (int i = 1; i < k; i++) cout << i * g << " ";
  cout << n - (((k * (k - 1))) / 2) * g << endl;
}
int main() {
  cin >> n >> k;
  if (k > 1e7) {
    cout << -1 << endl;
    return 0;
  }
  vector<long long> divs;
  for (int i = 1; 1ll * i * i <= n; i++) {
    if (n % i == 0) {
      divs.push_back(i);
      long long g = n / i;
      long long val1 = (n / g) - (k * (k - 1) / 2);
      long long val2 = k - 1;
      if (val1 > val2) solve(g);
      if (f) break;
    }
  }
  if (f) return 0;
  for (int i = divs.size() - 1; i >= 0; i--) {
    long long g = divs[i];
    long long val1 = (n / g) - (k * (k - 1) / 2);
    long long val2 = k - 1;
    if (val1 > val2) solve(g);
    if (f) break;
  }
  if (f) return 0;
  cout << -1 << endl;
}
