C. Maximal GCDtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou 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.InputThe first line consists of two numbers n and k (1 ≤ n, k ≤ 1010).OutputIf the answer exists then output k numbers — resulting sequence. Otherwise output -1. If there are multiple answers, print any of them.ExamplesInput6 3Output1 2 3Input8 2Output2 6Input5 3Output-1
Input6 3
Output1 2 3
['constructive algorithms', 'greedy', 'math', '*1900']