← 返回题目

题库练习 Maximal GCD

← 上一题下一题 →

A10878 | $Maximal GCD$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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.

输入输出样例

输入 #1

6 3

输出 #1

1 2 3

输入 #2

8 2

输出 #2

2 6

输入 #3

5 3

输出 #3

-1

C++ 编辑器

输入

输出