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
#min query から初期化を0にしてminを+に変えただけ
#minquery の方は0-indexだったがこっちは1-index
n,q = map(int,input().split( ))
s = 1
while s < n:
    s*=2

A = [0]*(2*s-1)

def query(a,b,k,l,r):#区間[a,b)について[l,r)を担当するkが答える
    if r<=a or b<=l:#はみ出る
        return 0
    if a<=l and r<=b:#含まれる
        return A[k]
    else:#ノード追うのが大変,##+1,+2
        c1 = query(a,b,2*k+1,l,(l+r)//2)    
        c2 = query(a,b,2*k+2,(l+r)//2,r)
        return c1+c2

for _ in range(q):
    c,x,y = map(int, input().split( ))
    if not c:
        x += (s-1)###-1
        x -=1###
        A[x] += y
        while x>0:
            x =(x-1)//2
            A[x] = A[x*2+1]+A[x*2+2]##+1,+2
        #print(A)
            
    else:
        print(query(x-1,y,0,0,s))
        #pass
