CF225B Well-known Numbers

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

The first line contains two integers $ s $ and $ k $ $ (1

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 $ m $ distinct integers $ a_{1},a_{2},...,a_{m} $ . 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.