#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MAXN = 2e5 + 7;
const double eps = 1e-14;
using namespace std;
void solve() {
  long long n, k;
  cin >> n >> k;
  if (k > 1e7) {
    cout << -1;
    return;
  }
  long long s = k * (k + 1) / 2;
  if (s > n) {
    cout << -1;
    return;
  }
  long long div = 1;
  long long p = 2 * sqrt(n);
  for (long long i = 2; i <= p; i++) {
    if (n % i == 0) {
      long long a = i;
      long long b = n / i;
      if (n / a >= s) {
        div = max(div, a);
      }
      if (n / b >= s) {
        div = max(div, b);
      }
    }
  }
  for (long long i = 1; i < k; i++) {
    cout << i * div << " ";
  }
  cout << n - (s - k) * div;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  if (!1) {
    freopen(
        "474"
        ".in",
        "r", stdin);
    freopen(
        "474"
        ".out",
        "w", stdout);
  }
  int t = 1;
  while (t--) solve();
  return 0;
}
