Distinct Arrays

You are given an array $A$ of $N$ integers - $A_1, A_2, \ldots, A_N$. Count the number of arrays $B$, also of length $N$, satisfying the following conditions: - $1 \le B_i \le A_i$ for all $1 \le i \le N$. - $B_i \ne B_j$ for each $1 \le i < j \le N$. Since the answer may be large, output it modulo $998244353$. ### Input - The first line of input will contain a single integer $T$, denoting the