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).
'''
BeezMinh
22:19 UTC+7
16/08/2023
'''
from sys import stdin
input = lambda: stdin.readline().rstrip()
s, k = map(int, input().split())
a, b = [0, 1], []
while a[-1] < s:
  a.append(sum(a[-k:]))
for i in reversed(a):
	if i <= s:
		b.append(i)
		s -= i
print(len(b))
print(*b)