Maximal GCD

请你构造一个长度为 $k$ 的严格上升正整数序列，使得所有数的和恰好为 $n$，并且所有数的最大公约数最大。输出这个序列。如果没有合法的序列输出 $-1$。如果有多个合法的序列，可以输出任意一个。 $1\le n,k\le 10^{10}$

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.

6 3

1 2 3

8 2

2 6

5 3

-1