Problem:
Range Sum Query

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.

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.

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.

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

Solution in C++14 (judge verdict: Accepted)

#include <bits/stdc++.h>
#ifdef dbg
#include "./printer.hpp"
#else
#define dump(x) void(0)
#endif

using namespace std;
#define ll long long
inline long  toInt(string s) {long  v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

int main(){
  ios_base::sync_with_stdio(0);

  ll n, q;
  cin >> n >> q;

  ll power = 1;
  ll sizepower;
  for(ll i = 1;;i++){
    power *= 2;
    if(n <= power){
      sizepower = i;
      break;
    }
  }

  vector<ll> d (1 << sizepower + 1, 0);
  
  for(ll i = 0; i < q; i++){
    ll t,x,y;
    cin >> t >> x >> y;
    if(t == 0){
      while(1){
	d[x] += y;
	if(x == 1 << sizepower){
	  break;
	}
	x = x + ((-x) & x);
      }
    }else{
      ll ans = 0;
      x--;
      while(1){
	if(x == 0){
	  break;
	}
	ans += d[x];
	x = x - (x & (-x));
      }
      ans *= -1;
      while(1){
	if(y == 0){
	  break;
	}
	ans += d[y];
	y = y - (y & (-y));
      }
      cout << ans << '\n';
    }

  }

}