#include <bits/stdc++.h>
using namespace std;
const int mx = 2e5 + 10;
const long long mod = 1e9 + 7;
long long n, k;
int main() {
  cin >> n >> k;
  if (k > 1000000) {
    printf("-1\n");
    return 0;
  }
  for (long long i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      long long gcd = n / i;
      long long tp = i;
      if ((k + 1) * k / 2 <= tp) {
        long long sum = 0;
        for (int j = 1; j < k; ++j) {
          printf("%I64d ", 1ll * j * gcd);
          sum += j;
        }
        printf("%I64d\n", 1ll * (tp - sum) * gcd);
        return 0;
      }
    }
  }
  int bg = sqrt(n + 10);
  for (int i = bg; i >= 1; --i) {
    if (n % i == 0) {
      long long tp = n / i;
      if ((k + 1) * k / 2 <= tp) {
        long long sum = 0;
        for (int j = 1; j < k; ++j) {
          printf("%I64d ", 1ll * j * i);
          sum += j;
        }
        printf("%I64d\n", 1ll * (tp - sum) * i);
        return 0;
      }
    }
  }
  printf("-1\n");
  return 0;
}
