#include <bits/stdc++.h>
using namespace std;
const int MAX = 200010;
const int MOD = 1000000007;
const int INF = 1e8;
const long long LLINF = 0x3f3f3f3f3f3f3f3f;
const long double EPS = 1e-7;
vector<long long> solve(long long n, long long k) {
  vector<long long> res;
  long long val = 1;
  for (int i = 0; i < (int)k - 1; i++) {
    res.push_back(val);
    n -= val;
    val++;
  }
  if (n >= val) {
    res.push_back(n);
    return res;
  }
  return vector<long long>();
}
int main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> res, dv;
  bool win = true;
  if (k > 200000) {
    win = false;
  }
  for (long long i = 1; i * i <= n and win; i++) {
    if (n % i == 0) {
      dv.push_back(i);
      if (n / i != i) {
        dv.push_back(n / i);
      }
    }
  }
  sort(dv.rbegin(), dv.rend());
  for (auto d : dv) {
    if (!win) break;
    vector<long long> r = solve(n / d, k);
    if (r.size()) {
      for (int i = 0; i < (int)r.size(); i++) {
        r[i] *= d;
      }
      swap(res, r);
      break;
    }
  }
  if (res.size() == 0) win = false;
  if (win) {
    for (auto r : res) cout << r << " ";
    cout << '\n';
  } else {
    cout << -1 << '\n';
  }
  return 0;
}
