#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC optimize("fast-math")
using namespace std;
const int DEBUG = 0;
mt19937 gen(
    (unsigned)chrono::high_resolution_clock::now().time_since_epoch().count());
#pragma comment(linker, "/STACK:16777216")
int isOk(long long n, long long k, long long d) {
  long long sum = 0;
  long long a = 0;
  for (int i = 0; i < k - 1; i++) {
    a += d;
    sum += a;
    if (sum > n) return 0;
  }
  if (n - sum > (k - 1) * d || sum + a + d == n)
    return 1;
  else
    return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.setf(cout.fixed);
  cout.precision(12);
  auto START_TIME = chrono::high_resolution_clock::now();
  long long n, k;
  cin >> n >> k;
  if (k > (long long)1e6 || k * (k + 1) / 2 > n) {
    cout << "-1";
    return 0;
  }
  long long div = -1;
  for (long long d = 1; d * d <= n; d++) {
    if (n % d == 0) {
      if (isOk(n, k, d)) div = max(div, d);
      if (isOk(n, k, n / d)) div = max(div, n / d);
    }
  }
  if (div == -1)
    cout << -1;
  else {
    long long sum = 0;
    long long a = 0;
    for (int i = 0; i < k - 1; i++) {
      a += div;
      sum += a;
      cout << a << " ";
    }
    cout << n - sum;
  }
  return 0;
}
