浙工大姗姗杯round1 D - Well-known Numbers

B. Well-known Numbers

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Numbers k-bonacci (k is integer, k > 1) are a generalization of Fibonacci numbers and are determined as follows:

• F(k, n) = 0, for integer n, 1 ≤ n < k;
• F(k, k) = 1;
• F(k, n) = F(k, n - 1) + F(k, n - 2) + ... + F(k, n - k), for integer n, n > 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.

Input

The first line contains two integers s and k (1 ≤ s, k ≤ 109; k > 1).

Output

In the first line print an integer m (m ≥ 2) that shows how many numbers are in the found representation. In the second line print mdistinct integers a1, a2, ..., am. Each printed integer should be a k-bonacci number. The sum of printed integers must equal s.

It is guaranteed that the answer exists. If there are several possible answers, print any of them.

Examples

input

5 2

output

3
0 2 3

input

21 5

output

3
4 1 16

算水题

题意：如上定义k波那契数，再给一个s，要求用至少两个k波那契数相加得到s。实际只要推出前k项就能得到整个数列，然后一直推到大于s为止。再从大到小dfs，不足2个加0.

注意第一项从f(k, k)开始，而不是从0开始，防止爆内存。

讲了这么多，比赛的时候没写出来，这就很尴尬，所以没有现成代码。

不服你来打我啊