CodeForces

You are given positive integer number n. You should create such strictly increasing sequence of k positive numbers a₁, a₂, ..., a_k, 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 ≤ 10¹⁰).

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

这题刚看一直以为数据有问题，1e10光输出就超时了啊
但是经过思考可以发现，当k * (k + 1) / 2 > n 时，直接输出-1. 所以其实k的范围不到1e5

题意是构造一个长度为k的严格递增的数组数组，要求这k个数组的最大公约数尽可能的大，且这k个数的和为n

解题思路：先解决数据范围的问题，我们设最大公约数为gcd，由严格递增可得，gcd取最小值为1，递增数组两数间的差取最小值1，则1 + 2 + 3 + …… + k <= n 否则就不存在，这样就缩小了数据范围

接下来是求出这个数组，既然k个数都是gcd的倍数，那么n也是gcd的倍数，所以最终答案的gcd一定是n的因子，那么我们可以通过循环1到sqrt(n)暴力找出最大的因子即可。（如果不知道为什么1到sqrt(n)就能找出所有因子，可以去学学筛选素数法。

附ac代码：

#include<iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string>
typedef long long ll;
using namespace std;
const int maxn = 1e6;
const int inf = 0x3f3f3f3f;
int nu[maxn];
int dis[maxn];
using namespace std;
int main()
{
    ll n, k;
    scanf("%lld %lld", &n, &k);

    ll sum = k * (k + 1) / 2;
    if(k + 1 > n * 2/ k) {
        printf("-1");
        return 0;
    } else if(k == 1) {
        printf("%lld", n);
        return 0;
    }
    ll i = 0;
    ll u = 0;
    ll sqt = sqrt(n) + 1;
    ll gcd = 0;
    for(i = 1; i <= sqt; ++i) {
        if(n % i == 0) {
            if(i >= sum) {
                gcd = n / i;
                break;
            } else if(n / i >= sum) {
                gcd = i;
            }
        }
    }
 //   printf("%lld i
", i);
    if(gcd == 0) printf("-1");
    else {
        for(ll j = 1; j <= k - 1; ++j) {
            printf("%lld ", gcd * j);
            n -= gcd * j;
        }
        printf("%lld", n);
    }
    return 0;
}