Problem Statement

There are $N$ people numbered $1$ through $N$, and $K$ items numbered $1$ through $K$. They play a turn-based game. Person $1$ takes the first turn, Person $2$ takes the next turn, then Person $3$, $\ldots$, Person $N$, then Person $1$ again, $\ldots$, Person $N$, Person $1$ again, $\ldots$, and so on, until all items are taken.

In each turn, the following happens:

• If the person already wins an item, nothing happens.
• Otherwise, he chooses one of the items he hasn't chosen yet uniformly at random, and secretly tells it to Snuke, the judge of the game. If the item is already taken by someone else, nothing happens; otherwise he wins the item.

For each $i$, compute the probability that Person $i$ wins an item, modulo $998,244,353$ (as described in the Notes section).

Note

• All random choices are made independently.
• We can prove that the game always ends in finite number of steps.
• We can also prove that, whenever a player is asked to choose an item, he has at least one item he hasn't chosen yet.
• We can also prove that the probabilities are rational numbers. When you print a probability, first write it as a fraction $\frac{y}{x}$, where $x, y$ are integers and $x$ is not divisible by $P = 998,244,353$ (under the constraints of the problem, such representation is always possible). Then, you need to print the only integer $z$ between $0$ and $P - 1$, inclusive, that satisfies $xz \equiv y \pmod{P}$.

Constraints

• $1 \leq K \leq N \leq 40$
• All values in the input are integers.

Input

Input is given from Standard Input in the following format:

N K

Output

Print $N$ lines. On the $i$-th line, print the probability that the $i$-th person wins an item, modulo $998,244,353$.