# Range Affine Range Sum

AC一覧

## Problem Statement問題文

Given a size $N$ interger sequence $a_0, a_1, \dots, a_{N - 1}$. Process $Q$ queries as follows:

• 0 $l$ $r$ $b$ $c$: For each $i = l, l+1, \dots, {r - 1}$, $a_i \gets b \times a_i + c$.
• 1 $l$ $r$: Print $\sum_{i = l}^{r - 1} a_i \bmod 998{,}244{,}353$.

• 0 $l$ $r$ $b$ $c$: 各 $i = l, l+1, \dots, {r - 1}$ について、$a_i \gets b \times a_i + c$
• 1 $l$ $r$: $\sum_{i = l}^{r - 1} a_i \bmod 998{,}244{,}353$ を出力する。

## Constraints制約

• $1 \leq N, Q \leq 500{,}000$
• $0 \leq a_i, c < 998{,}244{,}353$
• $1 \leq b < 998{,}244{,}353$
• $0 \leq l < r \leq N$

## Input入力

$N$ $Q$
$a_0$ $a_1$ ... $a_{N - 1}$
$\textrm{Query}_0$
$\textrm{Query}_1$
:
$\textrm{Query}_{Q - 1}$


### # 1

5 7
1 2 3 4 5
1 0 5
0 2 4 100 101
1 0 3
0 1 3 102 103
1 2 5
0 2 5 104 105
1 0 5

15
404
41511
4317767


Timelimit: 5 secs

Before submitting, please confirm terms and conditions