#include <bits/stdc++.h>
using namespace std;
long long z = 1e9 + 7;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = (res * a) % z;
      b--;
    } else {
      a = (a * a) % z;
      b = b >> 1;
    }
  }
  return res;
}
vector<long long> sieve;
map<long long, long long> m;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  vector<long long> pp;
  pp.assign(1000001, 0);
  for (long long i = 2; i < 1000; i++) {
    if (!pp[i]) {
      for (long long j = i * i; j <= 1000000; j += i) {
        pp[j] = 1;
      }
    }
  }
  for (long long i = 2; i <= 1000000; i++)
    if (!pp[i]) sieve.push_back(i);
  long long t;
  t = 1;
  while (t--) {
    long long n, k;
    cin >> n >> k;
    if (k >= 1e6) {
      cout << "-1\n";
      continue;
    }
    long long p = (k * (k + 1)) / 2;
    if (p > n) {
      cout << "-1\n";
      continue;
    }
    long long ans = 1e18;
    for (long long i = 1; i <= sqrt(n); i++) {
      if (n % i == 0) {
        if (i >= (k * (k + 1) / 2)) {
          ans = i;
          break;
        }
      }
    }
    for (long long i = sqrt(n); i >= 1; i--) {
      if (n % i == 0) {
        long long sum = n / i;
        if (sum >= (k * (k + 1)) / 2) {
          ans = min(ans, sum);
          break;
        }
      }
    }
    if (ans == 1e18)
      cout << "-1\n";
    else {
      long long g = n / ans;
      for (long long i = 1; i < k; i++) {
        cout << g * i << " ";
        ans -= i;
      }
      cout << g * ans << "\n";
    }
  }
}
