#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  long long ans = 0, n, k;
  vector<long long> v;
  cin >> n >> k;
  if (k > n || k > (long long)1e7 || k * (k + 1) > 2 * n) {
    cout << "-1";
    return 0;
  }
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      v.push_back(i);
      v.push_back(n / i);
    }
  }
  v.push_back(1), v.push_back(n);
  sort(v.begin(), v.end());
  long long start = 0, end = v.size() - 1, mid;
  while (start < end) {
    mid = (start + end + 1) / 2;
    if (k * (k + 1) / 2 <= (n / v[mid]))
      start = mid;
    else
      end = mid - 1;
  }
  for (long long i = 1; i < k; ++i) {
    cout << (i * v[start]) << " ";
    ans += i * v[start];
  }
  cout << n - ans;
  return 0;
}
