Background

This is a template problem.

Problem Description

You are given a falling-factorial polynomial $F(x)=\displaystyle\sum_{i=0}^{n-1}a_ix^{\underline{i}}$.

Find an ordinary polynomial $G(x)=\displaystyle\sum_{i=0}^{n-1}b_ix^i$.

Such that $G(x)=F(x)$.

All operations are performed modulo $998244353$.

Input Format

The first line contains a positive integer $n$, as described above.

The second line contains $n$ numbers, where the $i$-th number represents $a_{i-1}$.

Output Format

Output one line with $n$ numbers, where the $i$-th number is $b_{i-1}$.

3
1 2 1

1 1 1

Hint

For all testdata, $a_i\in\lbrack0,998244353)$.

This problem has $10$ subtasks.

Among them, $3$ subtasks have $n=2000$.

The other $7$ subtasks have $n=200000$.

Constraints

Translated by ChatGPT 5