#include <bits/stdc++.h>
using namespace std;
int i, j, m, s, ans;
long long n, k, t;
double sum;
int main() {
  scanf("%lld%lld", &n, &k);
  sum = (1.0 + k) * k / 2;
  if (sum > n) {
    puts("-1");
    return 0;
  }
  t = sum;
  for (int i = 1; (long long)i * i <= n; i++)
    if (n % i == 0) {
      int k = i;
      if (n / k - t >= 0) ans = max(ans, k);
      k = n / i;
      if (n / k - t >= 0) ans = max(ans, k);
    }
  for (int i = 1; i < k; i++) {
    printf("%lld ", (long long)i * ans);
    n -= (long long)i * ans;
  }
  printf("%lld\n", n);
  return 0;
}
