Fito is a successful businessman who finances young software developers when they start working on their projects. This year, he decided to distribute $K$ Cuban pesos (CUP) to $N$ projects in a way that each project gets at least one peso and all projects get a different amount of pesos. This will always be possible.

Write a program which will, for a given $N$ and $K$, find one possible distribution of $K$ Cuban pesos to $N$ projects.

The first line contains a positive integer $K$ $(100 \leq K \leq 1 000 000)$, number from the task description.
The second line contains a positive integer $N$ $(1 \leq N \leq 100)$, number from the task description.

For a chosen money distribution, output the amount of money the first project will get in the first line,
the amount of money the second project will get in the second line and so on until the $N$-th line where
you should output the amount of money the $N$-th project will get.

Input

100
5

Output

10
30
20
5
35

Input

200
1

Output

200

Input

100
4

Output

21
36
12
31