Range Sum Query

Write a program which manipulates a sequence A = {a₁, a₂, . . . , a_n} with the following operations:

• add(i, x): add x to a_i.
• getSum(s, t): print the sum of a_s, a_s+1,...,a_t.

Note that the initial values of a_i (i = 1, 2, . . . , n) are 0.

Input

n q
com1 x1 y1
com2 x2 y2
...
comq xq yq

In the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes add(x_i, y_i) and '1' denotes getSum(x_i, y_i).

Output

For each getSum operation, print the sum in a line.

Constraints

• 1 ≤ n ≤ 100000
• 1 ≤ q ≤ 100000
• If com_i is 0, then 1 ≤ x_i ≤ n, 0 ≤ y_i ≤ 1000.
• If com_i is 1, then 1 ≤ x_i ≤ n, 1 ≤ y_i ≤ n.

Sample Input 1

3 5
0 1 1
0 2 2
0 3 3
1 1 2
1 2 2

Sample Output 1

3
2