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).
li = list(map(int,input().split()))

k = li[1]
s = li[0]
big = 1000000000


arr=[1]
for i in range(k-1):
    arr.insert(0,0)


for i in range(k+1,big+1):

    if sum(arr[i-k-1:]) < s:
        arr.append(sum(arr[i-k-1:]))

    else:
        break


        

arr2=[]
p = len(arr)
sum = 0
for i in range(p):
    sum+=arr[p-i-1]

    

    if sum<=s:
        arr2.append(arr[p-1-i])
        if sum==s:
            break

    else:
        sum-=arr[p-i-1]


        
print(len(arr2))
for i in arr2:
    print(i,end=" ")
    
    

