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
# -*- coding: utf-8 -*-
"""
Range Add Query (RAQ)
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_E&lang=ja

"""
import sys


def main(args):
    def add(b, k, x):
        while k <= n:
            b[k] += x
            k += k & -k

    def get(b, k):
        s = 0
        while k > 0:
            s += b[k]
            k -= k & -k
        return s

    n, queries = map(int, input().split())
    bit0 = [0] * (n + 1)
    bit1 = [0] * (n + 1)

    for _ in range(queries):
        q, *args = input().split()
        args = [int(a) for a in args]
        if q == '1':
            res = get(bit0, args[0]) + get(bit1, args[0]) * args[0]
            res -= get(bit0, args[0] - 1) + get(bit1, args[0] - 1) * (args[0] - 1)
            print(res)
        else:
            add(bit0, args[0], -args[2] * (args[0] - 1))
            add(bit1, args[0], args[2])
            add(bit0, args[1] + 1, args[2]* args[1])
            add(bit1, args[1] + 1, -args[2])


if __name__ == '__main__':
    main(sys.argv[1:])

