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 power(a, b):
    if b == 0:
        return 1
    elif b % 2 == 0:
        a_1 = a * a
        return pow(a_1, b // 2)
    return a * pow(a, b - 1)


def k_fib(s, k):
    result = list()
    if k >= 40:
        fibs = [power(2, i) for i in range(40)]
    else:
        fibs = [0] * (k - 1) + [1]
        while fibs[len(fibs) - 1] < s:
            fibs.append(sum(fibs[-k:]))
    while s > 0:
        if fibs[len(fibs) - 1] <= s:
            result.append(fibs[len(fibs) - 1])
            s -= fibs[len(fibs) - 1]
        fibs.pop()
    return result


S, K = [int(j) for j in input().split()]
print(len(k_fib(S, K)))
print(*k_fib(S, K))
