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).
s,k=map(int,input().split())
arr=[0];k1=0;visited=[];mini=0
while(1):
    k1+=1
    if(k1==k):arr.append(1);
    elif(k1<k):arr.append(0);
    else:
        sum1=0
        for i in range(k1-1,k1-k-1,-1):
            sum1+=arr[i]
        if(sum1>=s):break;
        arr.append(sum1)
while(s>0):
    for i in arr:
        if(i<=s):mini=i;
        else:break;
    s-=mini;visited.append(mini);
print(len(visited))
print(*visited)        