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

* add(s, t, x): add x to as, as+1, ..., at.
* get(i): output the value of ai.



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

Constraints

* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
* 1 ≤ s ≤ t ≤ n
* 1 ≤ i ≤ n
* 0 ≤ x ≤ 1000

Input


n q
query1
query2
:
queryq


In the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:


0 s t x


or


1 t


The first digit represents the type of the query. '0' denotes add(s, t, x) and '1' denotes get(i).

Output

For each get operation, print the value.

Examples

Input

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


Output

3
5


Input

4 3
1 2
0 1 4 1
1 2


Output

0
1
N,Q = map(int, input().split())

data = [0]*(N+1)
def add(k, x,y):
    while k <= N:
        data[k] += y
        k += k & -k
    x+=1
    while x <= N:
        data[x] -= y
        x += x & -x
def get(k):
    s = 0
    while k:
        s += data[k]
        k -= k & -k
    return s
for i in range(Q):
    t = list(map(int, input().split()))
    if t[0] == 1:
        print(get(t[1]))
    else:
        add(t[1],t[2],t[3])
