#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long ans[1000005];
long long cal(long long x) {
  if (x % 2 == 1)
    return (x + 1) / 2 * x;
  else
    return x / 2 * (x + 1);
}
int main() {
  scanf("%llu%llu", &n, &k);
  if (k > 999999999 || n < cal(k)) {
    printf("-1\n");
    return 0;
  }
  long long t = cal(k);
  int cnt = 0;
  long long i;
  for (i = 1; i * i < n; i++) {
    if (n % i == 0) {
      ans[cnt++] = i;
      ans[cnt++] = n / i;
    }
  }
  if (n % i == 0) ans[cnt++] = i;
  sort(ans, ans + cnt);
  t = cal(k - 1);
  int j;
  for (j = cnt - 1; n - ans[j] * t < 0; j--)
    ;
  for (; (n - ans[j] * t) % ans[j] || ((n - ans[j] * t) <= ans[j] * (k - 1));
       j--) {
    if (j == 0) {
      printf("-1\n");
      return 0;
    }
  }
  for (int i = 1; i < k; i++) {
    printf("%llu ", ans[j] * i);
  }
  printf("%llu\n", n - ans[j] * t);
  return 0;
}
