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,k=[int(i) for i in input().split()]
a=[-1,0,1,1]
i=3
while a[i]<=pow(10,9):
    i+=1
    a.append(0)
    if i<=k:
        for j in range(1,i):
            a[i]+=a[j]
    else:
        for j in range(i-k,i):
            a[i]+=a[j]
for j in range(1,i+1):
    for j2 in range(1,i+1):
        for j3 in range(1,i+1):
            if a[j]!=a[j2]!=a[j3] and a[j]+a[j2]+a[j3]==s:
                print(3)
                print(a[j],a[j2],a[j3])
                exit()