#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr);
  vector<long long> fac;
  long long n, k;
  cin >> n >> k;
  if (k > 1000000) {
    cout << -1 << "\n";
    return 0;
  }
  long long sq = sqrt(n);
  for (int i = 1; i <= sq; i++) {
    if (n % i == 0) {
      fac.push_back(i);
      long long div = n / i;
      if (i != div) fac.push_back(div);
    }
  }
  long long MN = (k * (k + 1)) / 2;
  sort(fac.begin(), fac.end());
  reverse(fac.begin(), fac.end());
  long long g = -1;
  vector<long long> ans;
  for (int i = 0; i < fac.size(); i++) {
    long long rem = n / fac[i];
    if (rem >= MN) {
      g = fac[i];
      for (long long j = 1; j < k; j++) {
        ans.push_back(g * j);
        rem -= j;
      }
      ans.push_back(g * rem);
      for (int j = 0; j < ans.size(); j++) cout << ans[j] << " ";
      return 0;
    }
  }
  cout << -1 << "\n";
  return 0;
}
