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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
class Binaryindextree{
  private:
    vector<ll>v;
  public:
    Binaryindextree(int n):v(n + 1){}
    ll sum(int i){
      ll res = 0;
      for(++i; i > 0; i -= i & -i)res += v[i];
      return res;
    }
    void add(int i,ll t){
      for(++i; i < v.size(); i += i & -i)v[i] += t;
      return;
    }
};
int main(){
  int n,q;
  cin >> n >> q;
  Binaryindextree BIT(n);
  rep(i,q){
    int a,b,c;
    cin >> a >> b >> c;
    if(a == 0){
      b--;
      BIT.add(b,c);
    }
    if(a == 1){
      b--,c--;
      cout << BIT.sum(c) - BIT.sum(b - 1) << endl;
    }
  }
  return 0;
}
