Write a program which manipulates a sequence A = {a1, a2, . . . , an} with the following operations:

* add(i, x): add x to ai.
* getSum(s, t): print the sum of as, as+1,...,at.



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

Constraints

* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
* If comi is 0, then 1 ≤ xi ≤ n, 0 ≤ yi ≤ 1000.
* If comi is 1, then 1 ≤ xi ≤ n, 1 ≤ yi ≤ n.

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(xi, yi) and '1' denotes getSum(xi, yi).

Output

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

Example

Input

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


Output

3
2
#include<stdio.h>
#include<iostream>
#include<fstream>
#include<string>
#include<math.h>
#include <vector>
#include <array>
using namespace std;

enum command {
	com_add = 0,		//add(i, x) : a_i???x??????????????????
	com_getSum = 1		//getSum(s, t) : as, as + 1, ???, at???????¨??????????????????????
	
};
const int INIT = 0;
int main(){
	std::istream & c_in = cin;
	int n, q;
	c_in >> n >> q;
	array<int, 100000> A;
	A.fill(INIT);

	for (int j = 0; j < q; ++j)
	{
		int com, x, y;
		c_in >> com >> x >> y;
		if (com == com_add)
		{
			A[x] += y;
		}
		else if (com == com_getSum)
		{
			//
			long m = 0;
			for (int i = x; i <= y; ++i)
			{
				m += A[i];
			}
			cout << m << endl;
		}
	}
}