Polycarpus 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.

Difficulty: interview

Starter code:

Solutions:
n,m = map(int,input().split())
a = n % m;
for i in range(m - a):
    print(n//m,end =' ')
for i in range(a):
    print(n//m+1,end = ' ')

n,m = input().split()

n=int(n)
m=int(m)

L=[]

least=n//m
remainder=n%m

for i in range(m):
    L.append(least)

for i in range(m):
    if(i==m-1):
        x=""
    else:
        x=" "
    if(remainder>0):
        print(least+1,end=x)
        remainder-=1
    else:
        print(least,end=x)


##A
from math import ceil,floor
n,m=list(map(int,input().split()))
L=[]
if not n%m:
    for _ in range(m):
        L.append(n//m)
else:
    MIN=floor(n/m)
    MAX=ceil(n/m)
    for _ in range(n%m):
        L.append(MAX)    
    for _ in range(m-(n%m)):
        L.append(MIN)
    
print(' '.join(map(str,L)))


n,m=map(int,input().split())
print(*[n//m+1 if i<n%m else n//m for i in range(m)])

n, m = input().split()

n = int(n)
m = int(m)

t = n % m

if t == 0:
    for i in range(m): print(n // m, end = ' ')
else:
    for i in range(m - t): print(n // m, end = ' ')
    for i in range(t): print(n // m + 1, end = ' ')


3

n, m = list(map(int, input().strip().split()))
t = n // m;
for x in range(m + 1):
    if x * t + (m - x) * (t + 1) == n:
        ans = [t] * x + [t + 1] * (m - x)
        break
print(' '.join(map(str, ans)))

n, m = map(int, input().split())
for i in range(0, m):
    print(n // m + (n % m != 0 and i < n % m), end = ' ')

n, m = map(int, input().split())
for i in range(0, m):
    print(n // m + (i < n % m), end = ' ')

n, m = map(int, input().split())
print(*([n // m + 1] * (n % m) + [n // m] * (m - n % m)))

n, m = list(map(int, input().split()))
q, r = divmod(n, m)
print((str(q+1)+' ') * r, (str(q)+' ') * (m - r))


def list2str(l):
    s = ""
    for d in l:
        s = s + str(d) + ' '
    s = s.strip()
    return s

def __starting_point():
    _input = input()
    data = list(map (int, _input.split() ) )
    n = data[0]
    m = data[1]

    avg = n // m
    plus = n - m * avg

    ans = list( [avg]*(m - plus) + [avg + 1]*plus )
    print( list2str(ans) )

__starting_point()

I=[int(i) for i in input().split()]
conf, friend = I[0], I[1]
answer=[]
ans=""
mod=conf%friend
for i in range(friend): answer.append(int((conf-mod)/friend))
for i in range(mod): answer[i]+=1
for i in range(friend): ans+=str(answer[i])+" "
print(ans[:-1])

n, m = map(int, input().split())
k, d = n // m, n % m
print((str(k) + ' ') * (m - d) + (str(k + 1) + ' ') * d)

n, k = map(int,input().split())
res = [n//k for i in range(k)]
for i in range(n%k):
    res[i] += 1

for x in sorted(res): print(x,end=' ')

import sys

n, m = [int(x) for x in (sys.stdin.readline()).split()]

if(n % m == 0):
    print(" ".join([str(int(n / m))] * m))
else:
    v = [str(int(n / m))] * (m - (n % m))
    v.extend([str(int(n / m) + 1)] * (n % m))
    print(" ".join(v))


import sys

def solve():
    n, m = map(int, input().split())
    res = [0] * m
    for i in range(n):
        res[i % m] += 1
    return ' '.join(map(str, res))

if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
print(solve())

def main():
    n, m = list(map(int, input().split()))
    n, r = divmod(n, m)
    print(" ".join([str(n)] * (m - r) + [str(n + 1)] * r))


def __starting_point():
    main()

__starting_point()

n, m = list(map(int, input().split()))
q, r = divmod(n, m)
print(' '.join(map(str, [q] * (m - r) + [q + 1] * r)))


n, m = map(int, input().split())
div = n // m
mod = n % m
lst = []
k = 1
for i in range(m):
    lst.append(div)
for item in lst:
    if mod != 0 and mod > 0:
        lst[lst.index(item)] = lst[lst.index(item)] + 1
    mod = mod - 1
lst.sort()
for item in lst:
    if k == len(lst)-1:
        print(item)
    print(item, end = ' ')
    


n, m = map(int, input().split())
ddiv = n // m
mod = n % m
lst = []
k = 1
for i in range(m):
    lst.append(ddiv)
for item in lst:
    if mod != 0 and mod > 0:
        lst[lst.index(item)] = lst[lst.index(item)] + 1
    mod = mod - 1
lst.sort()
for item in lst:
    if k == len(lst)-1:
        print(item)
    print(item, end = ' ')
    


n,m=map(int,input().split())
x=n//m
y=n%m
print(' '.join([str(x+1)]*y+[str(x)]*(m-y)))

n,m = map(int, input().split())
cur = n;
for i in range(0,m):
    print( cur // (m - i),end = ' ')
    cur -= cur // (m - i)


n, m = map(int, input().split())
for i in range(m):
    print(n // m, end = ' ')
    n -= n // m
    m -= 1