题目描述

In the JAG country, there are a total of $m$ universities, and we plan to invite $2n$ students to a training camp. Each student is affiliated with one of the $m$ universities. During the training camp, the students will be accommodated in $n$ twin rooms, meaning that each room will be assigned to exactly two students.

To promote diverse interactions among the students, our goal is to achieve a "good room assignment". A room assignment is considered good if and only if the students sharing the same room come from different universities.

Here, we are wondering how often a good room assignment is feasible. There are $m^{2n}$ possible sequences of universities to which each student belongs, and please find for how many of them there is a good room assignment.

Actually, we don't yet know how many rooms we can provide. Therefore, for each of $n = 1, 2, \ldots, m$, please find for how many of the sequences of universities there is a good room assignment.

Since the answer may be huge, print the answers modulo $998,244,353$.

输入格式

The input is a single line containing an integer $m$ between $1$ and $200,000$, inclusive.

输出格式

Output $m$ lines. In the $i$-th line, you should output the answer for $n = i$.

3

6
54
510

5

20
540
14300
370300
9454620

20

380
158460
63889400
636003875
443532759
163564701
433390846
160318339
979712600
445802634
862134704
374397421
898644169
181404073
884138261
856576908
608198482
349239556
724235122
812173715