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).
import sys
import math
from sys import stdin, stdout
 
# TAKE INPUT
def get_ints_in_variables():
    return map(int, sys.stdin.readline().strip().split())
def get_int(): return int(input())
def get_ints_in_list(): return list(
    map(int, sys.stdin.readline().strip().split()))
def get_list_of_list(n): return [list(
    map(int, sys.stdin.readline().strip().split())) for _ in range(n)]
def get_string(): return sys.stdin.readline().strip()
 
def main():
    # Write Your Code Here
    n, k = get_ints_in_variables()
    f = []
    for i in range(0, 100000+1):
        f.append(0)
    f[1] = 1
    i = 1
    while True:
        if f[i] > n:
            break
        i += 1
        j = i-k
        while j < i:
            f[i] += f[j]
            j+=1
    
    ans = []
    ans.append(0)
    j = i
    while j >= 1:
        if f[j] <= n:
            n-=f[j]
            ans.append(f[j])
        j -= 1
    
    print(len(ans))
    for i in range(0, len(ans)):
        print(ans[i],end=" ")


        

#  calling main Function
if __name__ == "__main__":
    main()