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
#include <iostream>
#include <vector>
#include <limits>
#include <algorithm>

struct RangeAddQuery{
    int n;
    std::vector<int> dat;

    void init(int n_){
        n = 1;
        while(n < n_) n *= 2;
        dat.resize(2 * n - 1, 0);
    }

    void add(int a, int b, int k, int l, int r, int x){
        if(r <= a || b <= l) return;
        if(a <= l && r <= b){
            dat[k] += x;
        }
        else{
            add(a, b, k * 2 + 1, l, (l + r) / 2, x);
            add(a, b, k * 2 + 2, (l + r) / 2, r, x);
        }
    }

    void add(int a, int b, int x){
        add(a, b, 0, 0, n, x);
    }

    int query(int k){
        k += n - 1;
        int res = dat[k];
        while(k > 0) {
            k = (k - 1) / 2;
            res += dat[k];
        }
        return res;
    }
};

using namespace std;

int main(){
    int n, q;
    cin >> n >> q;
    RangeAddQuery raq;
    raq.init(n);
    while(q--){
        int com;
        cin >> com;
        if(com){
            int i;
            cin >> i;
            cout << raq.query(i - 1) << "\n";
        }else{
            int s, t, x;
            cin >> s >> t >> x;
            raq.add(s - 1, t, x);
        }
    }
}
