Numbers *k*-bonacci (*k* is integer, *k* &gt; 1) are a generalization of Fibonacci numbers and are determined as follows:
 -  *F*(*k*, *n*) = 0, for integer *n*, 1 ≤ *n* &lt; *k*; -  *F*(*k*, *k*) = 1; -  *F*(*k*, *n*) = *F*(*k*, *n* - 1) + *F*(*k*, *n* - 2) + ... + *F*(*k*, *n* - *k*), for integer *n*, *n* &gt; *k*. 
Note that we determine the *k*-bonacci numbers, *F*(*k*, *n*), only for integer values of *n* and *k*.

You've got a number *s*, represent it as a sum of several (at least two) distinct *k*-bonacci numbers.
The first line contains two integers *s* and *k* (1 ≤ *s*, *k* ≤ 10<sup class="upper-index">9</sup>; *k* &gt; 1).
import sys
input = lambda: sys.stdin.readline().rstrip()

s,k = map(int, input().split())
A = []

for i in range(s+2):
    if i<k:
        A.append(0)
    elif i==k:
        A.append(1)
    else:
        tmp = 0
        for j in range(len(A)-1,max(-1,len(A)-1-k),-1):
            tmp+=A[j]
        if tmp>=s:break
        A.append(tmp)
        
#print(A)
ans = []
for i in range(len(A)-1,-1,-1):
    if s>=A[i]:
        ans.append(A[i])
        s-=A[i]
        
print(*ans)
        