#include <bits/stdc++.h>
using namespace std;
long long ans[500000], mult = 1, rmult = 1, found = 0;
int main() {
  ios_base::sync_with_stdio(0);
  long long n, k;
  cin >> n >> k;
  if (k >= 1e6 || k * (k + 1) / 2 > n) {
    cout << -1 << endl;
    return 0;
  }
  for (long long i = 1; i * i <= n; i++) {
    if (n % i != 0) continue;
    if (i * k * (k + 1) / 2 <= n) mult = i;
    if (i >= k * (k + 1) / 2 && !found) rmult = n / i, found = 1;
  }
  mult = max(mult, rmult);
  for (int i = 0; i < k; i++) ans[i] = (i + 1) * mult;
  ans[k - 1] += n - mult * k * (k + 1) / 2;
  for (int i = 0; i < k; i++) cout << ans[i] << " \n"[i == k - 1];
}
