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()))
a=[0]*(51)
a[1]=1
for i in range(2,51):
    a[i]=a[i-1]+a[i-2]
    if a[i]>=10**10:
        break
index=bisect.bisect_left(a,s)
#print(index)
#print(a)
if a[index]==s:
    print(1)
    print(a[index])
else:
    remain=s-a[index-1]
    ans=[]
    ans.append(a[index-1])
    for j in range(index-2,-1,-1):
        if a[j]-remain==0:
            ans.append(a[j])
            break
        elif remain-a[j]>0:
            remain-=a[j]
            ans.append(a[j])
    print(len(ans))
    print(*ans)
            
    
    
    