#include <bits/stdc++.h>
using namespace std;
long long n, k, ans;
bool can(long long g) {
  long long sum = n - k * (g + g * k) / 2;
  if (sum < 0) return 0;
  return sum % g == 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  if (k > (long long)1e8 || k * (k + 1) / 2 > n) return cout << -1 << endl, 0;
  ;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0 && can(i)) ans = max(ans, i);
    if (n % (n / i) == 0 && can(n / i)) ans = max(ans, n / i);
  }
  for (int i = ans, j = 0; j < k - 1; j++, i += ans) {
    cout << i << " ";
    n -= i;
  }
  cout << n << endl;
  return 0;
}
