PivotOJ

Nadan

시간 제한: 1000ms메모리 제한: 64MB출처: COCI 2018-2019BOJ 16239

문제

Alongside being a palindrome, Nadan is also a successful businessman who finances young software developers when they start working on their projects. This year, he decided to distribute K kunas (Croatian currency) to N projects in a way that each project gets at least one kuna and all projects get a different amounts of kunas. This will always be possible.

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

입력

The first line contains a positive integer K (100 ≤ K ≤ 1 000 000), number from the task description. The second line contains a positive integer N (1 ≤ N ≤ 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.

예제

예제 1

입력
100
5
출력
10
30
20
5
35

예제 2

입력
200
1
출력
200

예제 3

입력
100
4
출력
21
36
12
31
코드를 제출하려면 로그인하세요.