803_C. Maximal GCD_13667
You are given positive integer number n. You should create such strictly increasing sequence of k positive numbers a1, a2, ..., ak, that their sum is equal to n and greatest common divisor is maximal.

Greatest common divisor of sequence is maximum of such numbers that every element of sequence is divisible by them.

If there is no possible sequence then output -1.

Input

The first line consists of two numbers n and k (1 ≤ n, k ≤ 1010).

Output

If the answer exists then output k numbers — resulting sequence. Otherwise output -1. If there are multiple answers, print any of them.

Examples

Input

6 3


Output

1 2 3


Input

8 2


Output

2 6


Input

5 3


Output

-1
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k, gcd = 0;
  cin >> n >> k;
  if (k > 141420) {
    cout << "-1" << endl;
    return 0;
  }
  long long temp = sqrt(n);
  long long summ = k * (k + 1) / 2;
  for (long long i = 1; i <= temp; i++)
    if (n % i == 0) {
      if (i >= summ) {
        gcd = n / i;
        break;
      } else if (n / i >= summ)
        gcd = i;
    }
  if (!gcd) {
    cout << "-1" << endl;
    return 0;
  }
  for (long long i = 1; i < k; i++) cout << i * gcd << " ";
  cout << gcd * (n / gcd - k * (k - 1) / 2) << endl;
}
