#include <bits/stdc++.h>
using namespace std;
const long long N = 100005;
long long n, k, fd, gcd, sum = 0;
int main() {
  cin >> n >> k;
  if (k > sqrt(2 * n)) {
    cout << "-1\n";
  } else {
    if ((k * (k + 1)) / 2 > n) {
      cout << -1;
    } else {
      fd = -1;
      for (long long i = (k * (k + 1)) / 2; i <= N; i++) {
        if (n % i == 0) {
          fd = i;
          break;
        }
      }
      if (fd == -1) {
        for (long long i = N; i >= 1; i--) {
          if (n % i == 0 && ((n / i) >= (k * (k + 1)) / 2)) {
            gcd = i;
            break;
          }
        }
      } else
        gcd = n / fd;
      for (long long i = 1; i < k; i++) {
        sum += gcd * i;
        cout << gcd * i << " ";
      }
      cout << (n - sum);
    }
  }
}
