CF803C.Maximal GCD

You are given positive integer number n. You should create such strictly increasing sequence of k positive numbers _a_1, _a_2, ..., 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.

给定一个正整数 $ n $。你需要构造一个严格递增的、由 $ k $ 个正整数组成的序列 $ a_1,,a_2,,...,,a_k $，使得该序列的和等于 $ n $，且其最大公约数尽可能大。

序列的最大公约数定义为：满足序列中每个元素均能被它整除的最大正整数。

若不存在满足条件的序列，则输出 $-1$。

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

第一行包含两个数字 $n$ 和 $k$（$1 \leq n, k \leq 10^{10}$）。

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

如果答案存在，则输出 k 个数——即所得序列；否则输出 -1。若存在多个答案，输出任意一个即可。