P7303 [COCI 2018/2019 #1] Nadan

Nadan is a successful businessman. He often invests in software developers. This year, he decided to distribute $K$ kuna (Croatian currency) to $N$ projects, such that each project receives at least $1$ kuna, and the amounts received are pairwise distinct and all are positive integers. The testdata guarantees that such a distribution always exists.

The first line contains a positive integer $K$. The second line contains a positive integer $N$.

Output $N$ lines in total. The $i$-th line should contain the amount allocated to the $i$-th project.

#### Constraints For $50\%$ of the testdata, $N = 5$. For $100\%$ of the testdata, $100 \le K \le 10^6$, $1 \le N \le 100$. #### Scoring If, for a test case, there exist equal allocated amounts but the total sum is correct, then you can get $3$ points out of the full $5$ points for that test case. This problem uses an unofficial self-written [Special Judge](https://www.luogu.com.cn/paste/g6huzk80), which can also be obtained in the attachments. Because of the Special Judge, please add a newline after the last number in your output. Hacks are welcome (you may send a private message or post directly). #### Notes **The score for this problem follows the original COCI problem setting, with a full score of $50$.** **Translated from [COCI2018-2019](https://hsin.hr/coci/archive/2018_2019/) [CONTEST #1](https://hsin.hr/coci/archive/2018_2019/contest1_tasks.pdf) _T1 Nadan_.** Translated by ChatGPT 5