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 bisect 
s,k=list(map(int,input().split()))
f=[0]*45
for i in range(45):
    if i<k:
        f[i]=0
    elif i==k:
        f[i]=1
    else:
        f[i]=sum([f[i-j] for j in range(1,k+1)])
ans=[0]
while s>0:
    i=bisect.bisect_right(f,s)
    ans.append(f[i-1])
    s=s-f[i-1]
print(len(ans))
for i in range(len(ans)):
    print(ans[i],end=' ')