AC一覧

## Problem Statement / 問題文

You are given an integer sequence $a_0, a_1, ..., a_{N-1}$ with the length $N$. Process the following $Q$ queries in order:

• 0 $p$ $x$: $a_p \gets a_p + x$
• 1 $l$ $r$: Print $\sum_{i = l}^{r - 1}{a_i}$

## Problem Statement (Japanese) / 問題文 (日本語)

• 0 $p$ $x$: $a_p = a_p + x$
• 1 $l$ $r$: $\sum_{i = l}^{r - 1}{a_i}$ を出力する。

## Constraints / 制約

• $1 \leq N, Q \leq 500,000$
• $0 \leq a_i, x \leq 10^9$
• $0 \leq p < N$
• $0 \leq l_i < r_i \leq N$

## Input / 入力

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


### # 1

5 5
1 2 3 4 5
1 0 5
1 2 4
0 3 10
1 0 5
1 0 3

15
7
25
6


Timelimit: 5 secs