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())


if k>=32:
    k_bon = [0]
    for i in range(33):
        k_bon.append(2**i)
else:
    k_bon = [0]*(k-1)
    k_bon.append(1)
    i = k+1
    c = 0
    while len(k_bon)<=100:
        next = sum(k_bon[c:i])
        k_bon.append(next)
        i+=1
        c+=1

k_bon = set(k_bon)
i = 0
ans = []
k_bon = sorted(list(k_bon))
# print(k_bon)
while s!=0:
    if k_bon[i] >= s:
       if s == k_bon[i]:
        s-=k_bon[i]
        # print(s)
        ans.append(k_bon[i])
        i = 0
       else:

        s-=k_bon[i-1]
        # print(s)
        ans.append(k_bon[i-1])
        i = 0

    else:
        i+=1
if len(ans) == 1:
    ans.append(0)
print(len(ans))
print(*ans)


