#include <bits/stdc++.h>
using namespace std;
template <class T>
void splitstr(const string &s, vector<T> &out) {
  istringstream in(s);
  out.clear();
  copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
static void redirect(int argc, const char **argv) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  if (argc > 1) {
    static filebuf f;
    f.open(argv[1], ios::in);
    cin.rdbuf(&f);
    if (!cin) {
      cerr << "Failed to open '" << argv[1] << "'" << endl;
      exit(1);
    }
  }
  if (argc > 2) {
    static filebuf f;
    f.open(argv[2], ios::out | ios::trunc);
    cout.rdbuf(&f);
    if (!cout) {
      cerr << "Failed to open '" << argv[2] << "'" << endl;
    }
  }
}
int main(int argc, const char **argv) {
  redirect(argc, argv);
  long long N, K;
  cin >> N >> K;
  if (K > 1000000) {
    cout << "-1\n";
    return 0;
  }
  long long minsum = K * (K + 1) / 2;
  long long top = (long long)ceil(sqrt(double(N))) + 1;
  long long best = 0;
  auto test = [&](long long f) {
    if (f > best && N / f >= minsum) best = f;
  };
  for (long long i = 1; i <= top; i++)
    if (N % i == 0) {
      test(i);
      test(N / i);
    }
  if (best == 0)
    cout << "-1\n";
  else {
    long long r = N / best;
    for (int i = 1; i < K; i++) cout << i * best << ' ';
    cout << (K + r - minsum) * best << '\n';
  }
  return 0;
}
