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 (judge verdict: Runtime Error)

#include<stdio.h>
#include<stdlib.h>
int main(void){

  int a[10000]={};
  int getSum[10000]={};
  int i=0;  
  int time=0;
  int b,x,s,t,n,q,d;

  scanf("%d %d",&n,&q);
  if(1>n||n>100000||1>q||q>100000){
  printf("Too Large\n");
  exit(0);
  }


  while(i<q){
    i++;
   scanf("%d",&b);

   if(b==0){
   scanf("%d",&d);
   scanf("%d",&x);
   if(d>n||x>1000){
   printf("Too Large\n");
   exit(0);
   }

   a[d] += x;
   }
 
   else if(b==1){
     time++;
   scanf("%d",&s);
   scanf("%d",&t);
   
   if(s>n||t>n){
   printf("Too Large\n");
   exit(0);
   }

   for(s;s<=t;s++){
     getSum[time] += a[s];
   }

   }


  }

  i=0;

  while(i<time){
    ++i;
    printf("%d\n",getSum[i]);

  }
  


}