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
input=sys.stdin.readline
s,k=map(int,input().split())
ans=[]
if k>=47:
  f=[0,1]
  x=1
  for i in range(47):
    f.append(x)
    x+=x
  for i in range(47)[::-1]:
    if s>=f[i]:
      ans.append(f[i])
      s-=f[i]
else:
  f=[0]*(k-1)+[1]
  x=1
  for i in range(47):
    f.append(x)
    y=x-f[i]
    x+=y
  ans=[]
  for i in range(47)[::-1]:
    if s>=f[i]:
      ans.append(f[i])
      s-=f[i]
print(len(ans))
print(*ans)