#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 69;
const int OO = 0x3f3f3f3f;
const int mod = 1000000007;
long long n, k;
vector<long long> st;
void fd() {
  for (long long i = 1; i * i <= n; ++i) {
    if (n % i == 0 && i != n / i) {
      st.push_back(i);
      st.push_back(n / i);
    } else
      st.push_back(i);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  long long all = k * (k + 1) / 2LL;
  if (n < all || k > 1e6) {
    cout << "-1\n";
    return 0;
  }
  fd();
  sort(begin(st), end(st), greater<long long>());
  for (int i = 0; i < (int)st.size(); i++) {
    all = k * (k + 1) / 2LL;
    if (all * st[i] <= n) {
      long long rem = n - all * st[i];
      if (rem % st[i] != 0) continue;
      for (int j = 1; j < k; j++) cout << st[i] * j << " ";
      cout << (st[i] * k) + rem << " ";
      return 0;
    }
  }
  return 0;
}
