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).
s = input().split()
(m,k) = (int(i) for i in s)
a = [0 for i in range(k-1)]
a.append(1)
i = 0
#print(a[-1],m)
while(a[-1] <= m):
	a.append(sum(a[i:i+k]))
	i += 1
res = []
res.append(a[-2])
m -= a[-2]
while(m>0):
	if(m in a):
		res.append(m)
		m = 0
	else:
		res.append(1)
		m -= 1

print(len(res))
res = res[::-1]
for i in range(len(res)):
	print(res[i], end = ' ')
