PolandBall and Many Other Balls

### 题目描述 有一排 $n$ 个球，定义一个组可以只包含一个球或者包含两个相邻的球。现在一个球只能分到一个组中，求从这些球中取出 $k$ 组的方案数。 $n\le 10^9$，$k<2^{15}$。 ### 样例解释 $(1),(2),(3),(12),(23)$ $(12)(3),(1)(23),(1)(2),(1)(3),(2)(3)$ $(1)(2)(3)$

PolandBall is standing in a row with Many Other Balls. More precisely, there are exactly $ n $ Balls. Balls are proud of their home land — and they want to prove that it's strong. The Balls decided to start with selecting exactly $ m $ groups of Balls, each consisting either of single Ball or two neighboring Balls. Each Ball can join no more than one group. The Balls really want to impress their Enemies. They kindly asked you to calculate number of such divisions for all $ m $ where $ 1<=m<=k $ . Output all these values modulo $ 998244353 $ , the Enemies will be impressed anyway.

There are exactly two numbers $ n $ and $ k $ ( $ 1<=n<=10^{9} $ , $ 1<=k&lt;2^{15} $ ), denoting the number of Balls and the maximim number of groups, respectively.

You should output a sequence of $ k $ values. The $ i $ -th of them should represent the sought number of divisions into exactly $ i $ groups, according to PolandBall's rules.

3 3

5 5 1 

1 1

1 

5 10

9 25 25 9 1 0 0 0 0 0 

In the first sample case we can divide Balls into groups as follows: $ {1} $ , $ {2} $ , $ {3} $ , $ {12} $ , $ {23} $ . $ {12}{3} $ , $ {1}{23} $ , $ {1}{2} $ , $ {1}{3} $ , $ {2}{3} $ . $ {1}{2}{3} $ . Therefore, output is: 5 5 1.