Problem11298--[yosupo] Polynomial - Exp of Formal Power Series (Sparse)

11298: [yosupo] Polynomial - Exp of Formal Power Series (Sparse)

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

You are given a formal power series $f(x) = \sum_{i=0}^{N-1} a_i x^i \in \mathbb{Q}[[x]]$ with $a_0 = 0$.
Only $K$ coefficients of $f$ are non-zero, and only such coefficients $a_{i_k}$ are given from input. 

Calculate the first $N$ terms of $\exp(f(x)) = \sum_{i=0}^{\infty} b_i x^i$.
In other words, find $g(x) = \sum_{i=0}^{N-1} b_i x^i \in \mathbb{Q}[[x]]$ such that

$g(x) \equiv \sum_{k=0}^{N-1} \frac{f(x)^k}{k!} \pmod{x^N}.$

Print the coefficients modulo $998244353$.

Input

$N$ $K$
$i_0$ $a_{i_0}$
$\vdots$
$i_{K-1}$ $a_{i_{K-1}}$

Output

$b_0$ $b_1$ $\cdots$ $b_{N - 1}$

Constraints

- $1 \leq N \leq 10^6$
- $0 \leq K \leq 10$
- $0 < i_0 < \cdots < i_{K-1} \leq N - 1$
- $1 \leq a_{i_k} < 998244353$

Sample 1 Input

5 1
2 1

Sample 1 Output

1 0 1 0 499122177

Sample 2 Input

10 4
1 1
2 2
3 3
4 4

Sample 2 Output

1 1 499122179 166374064 291154613 690452358 558739571 801170355 116437135 935147171

Sample 3 Input

10 0

Sample 3 Output

1 0 0 0 0 0 0 0 0 0

HINT

Source/Category