Score : $600$ points
There are $N$ trees. On Day $0$, each tree bears no fruits.
On the morning of Day $1$ and subsequent days, the $i$-th tree bears $i$ new fruits for each $i = 1, 2, \ldots, N$.
Takahashi will perform $Q$ harvesting. For each $i = 1, 2, \ldots, Q$, the $i$-th harvesting takes place on the night of Day $D_i$, collecting all fruits remaining on the $L_i$-th through $R_i$-th trees at that point.
For each of the $Q$ harvesting, print the number of fruits Takahashi will collect, modulo $998244353$.
Input is given from Standard Input in the following format:
$N$ $Q$ $D_1$ $L_1$ $R_1$ $D_2$ $L_2$ $R_2$ $\vdots$ $D_Q$ $L_Q$ $R_Q$
Print $Q$ lines. For each $i = 1, 2, \ldots, Q$, the $i$-th line should contain the number of fruits Takahashi will collect in the $i$-th harvesting, modulo $998244353$.
5 3 2 2 3 3 3 4 5 1 5
10 15 50
For each $i = 1, 2, 3, 4, 5$, let $A_i$ be the number of fruits remaining on the $i$-th tree. Now, we use the sequence $A = (A_1, A_2, A_3, A_4, A_5)$ to represent the numbers of fruits remaining in the trees.
711741968710511029 1 82803157126515475 516874290286751784 588060532191410838
603657470
Be sure to print the numbers modulo $998244353$.