A10878. 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.

The first line consists of two numbers $n$ and $k$ ( $1<=n,k<=10^{10}$ ).

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