CF306A.Candies

Polycarpus has got n candies and m friends (n ≥ m). He wants to make a New Year present with candies to each friend. Polycarpus is planning to present all candies and he wants to do this in the fairest (that is, most equal) manner. He wants to choose such a__i, where a__i is the number of candies in the i-th friend's present, that the maximum a__i differs from the least a__i as little as possible.

For example, if n is divisible by m, then he is going to present the same number of candies to all his friends, that is, the maximum a__i won't differ from the minimum one.

波利卡普斯有 $n$ 颗糖果和 $m$ 位朋友（满足 $n \geq m$）。他想为每位朋友准备一份新年礼物，每份礼物都由若干颗糖果组成。波利卡普斯打算把所有糖果全部送出，并希望以尽可能公平（即最均等）的方式分配。他希望选择一组数 $a_i$，其中 $a_i$ 表示第 $i$ 位朋友收到的糖果数量，使得最大的 $a_i$ 与最小的 $a_i$ 之间的差值尽可能小。

例如，若 $n$ 能被 $m$ 整除，则他将向所有朋友赠送相同数量的糖果，此时最大值 $a_i$ 与最小值 $a_i$ 相等，差值为零。

The single line of the input contains a pair of space-separated positive integers n, m (1 ≤ n, m ≤ 100;n ≥ m) — the number of candies and the number of Polycarpus's friends.

输入仅包含一行，为两个用空格分隔的正整数 $n$、$m$（$1 ≤ n, m ≤ 100$；$n ≥ m$），分别表示糖果的数量和 Polycarpus 的朋友数量。

Print the required sequence _a_1, _a_2, ..., a__m, where a__i is the number of candies in the i-th friend's present. All numbers a__i must be positive integers, total up to n, the maximum one should differ from the minimum one by the smallest possible value.

输出所需的序列 $a_1,\,a_2,\,...,\,a_m$，其中 $a_i$ 表示第 $i$ 位朋友收到的糖果数量。所有数 $a_i$ 必须为正整数，总和为 $n$，且最大值与最小值之差应尽可能小。

Print a__i in any order, separate the numbers by spaces.

以任意顺序输出 $a_i$，数字之间用空格分隔。