#include <bits/stdc++.h>
using namespace std;
vector<long long> divs;
void printDivisors(long long n) {
  for (long long i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        divs.push_back(i);
      else
        divs.push_back(i);
      divs.push_back(n / i);
    }
  }
}
int main() {
  long long n, k;
  cin >> n >> k;
  if (k >= 1e6) {
    cout << "-1";
    return 0;
  }
  if (k * (k + 1) / 2 > n) {
    cout << "-1";
    return 0;
  }
  printDivisors(n);
  sort(divs.begin(), divs.end());
  long long prev = 0;
  for (long long i = 0; i < divs.size(); i++) {
    long long temp = k * (k + 1) / 2 * divs[i];
    if (temp > n) break;
    prev = i;
  }
  for (long long i = 1; i < k; i++) {
    cout << divs[prev] * i << " ";
  }
  long long temp = n - k * (k - 1) / 2 * divs[prev];
  cout << temp << endl;
}
