The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Candies

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPolycarpus 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.

Input

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.

Output

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.

Examples

Input

12 3

Output

4 4 4

Input

15 4

Output

3 4 4 4

Input

18 7

Output

2 2 2 3 3 3 3

Note

Print *a*_{i} in any order, separate the numbers by spaces.

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/16/2022 16:36:18 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|