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).
def kbon (s,k):
    if 2**k < s:
        l = [1] + [2**i for i in range(0,k-1)]
        su = sum(l)
        i = 0
        while su <= s:
            l.append(su)
            su = su * 2 - l[i]
            i += 1
    else:
        l , i, u = [], 0, 1
        while u <= s:
            l.append(u)
            u = 2**i
            i += 1
    return l[-1]

sol = []
    
s, k = (int(x) for x in input().split())
while s > 0:
    a = kbon(s,k)
    sol.append(a)
    s = s - a

if len(sol) == 1: sol.append(0)  
print(len(sol))
print(*sol)