#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
void solve() {
  long long n, k;
  cin >> n >> k;
  if (k > 1000000) {
    cout << "-1\n";
    return;
  }
  long long ans = -1;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      long long x = n - i * ((k * (k - 1)) / 2);
      if (x > i * (k - 1) && x % i == 0) {
        ans = max(ans, i);
      }
      long long I = i;
      i = n / i;
      x = n - i * (k * (k - 1)) / 2;
      if (x > i * (k - 1) && x % i == 0) {
        ans = max(ans, i);
      }
      i = I;
    }
  }
  if (ans == -1) {
    cout << "-1\n";
    return;
  }
  for (long long i = 0; i < k - 1; i += 1) {
    cout << ans * (1 + i) << ' ';
  }
  cout << n - ans * (k * (k - 1)) / 2 << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long tin = 1;
  while (tin--) solve();
  return 0;
}
