Problem:
Score : 100 points

Problem Statement

You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.

0 p x: a_p \gets a_p + x

1 l r: Print \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

All values in Input are integer.

Input

Input is given from Standard Input in the following format:

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

Output

For each query of the latter type, print the answer.

Sample Input 1

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

Sample Output 1

15
7
25
6

Solution in C (GCC 9.2.1) (judge verdict: Accepted)

#include<stdio.h>
int N;
long data[] = {[0 ... 1<<19] 0};
void fen_add(int p, long x){
	p++;
	while(p <= N){
		data[p-1] += x;
		p += p & -p;
	}
}
long fen_sum(int r){
	long s = 0;
	while(r > 0){
		s += data[r-1];
		r -= r & -r;
	}
	return s;
}
long fen_range(int l, int r){
	return fen_sum(r) - fen_sum(l);
}

int Q;
int main(){
	scanf("%d%d", &N, &Q);
	for(int i=0; i<N; i++){
		int a;
		scanf("%d", &a);
		fen_add(i, a);
	}
	while(Q--){
		int t, x, y;
		scanf("%d%d%d", &t, &x, &y);
		if(t) printf("%ld\n", fen_range(x, y));
		else fen_add(x, y);
	}
	return 0;
}