AT_abc478_a [ABC478A] Grapes

There are $ N $ people numbered from $ 1 $ to $ N $ . There are $ M $ grapes. They will be distributed to the $ N $ people as follows. - Give one grape each to persons $ 1,2,\dots,N $ in this order. If the grapes run out midway, the distribution ends at that point. - If there are still grapes remaining after giving to person $ N $ , go back to person $ 1 $ and distribute in order again. Repeat this until the grapes run out. Find how many grapes each person receives.

The input is given from Standard Input in the following format: > $ N $ $ M $

Output $ N $ lines. The $ i $ -th line should contain the number of grapes person $ i $ receives.

### Sample Explanation 1 The five grapes are given one at a time to persons $ 1,2,3,1,2 $ in this order. ### Sample Explanation 2 There may be people who receive no grape. ### Sample Explanation 3 Everyone may receive the same number of grapes. ### Constraints - $ 1 \leq N \leq 100 $ - $ 1 \leq M \leq 10000 $ - All input values are integers.