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>
using namespace std;

#define SEG_NUM (1<<20)

int seg[SEG_NUM*2];

int find(int x){
    x += SEG_NUM;
    int ans = 0;
    while(x > 0){
        ans += seg[x];
        x /= 2;
    }
    return ans;
}

void update(int s, int t, int x){
    s += SEG_NUM;
    t += SEG_NUM;
    while(s < t){
        if(s % 2 == 1){
            seg[s] += x;
            s++;
        }
        s /= 2;
        if(t % 2 == 1){
            seg[t-1] += x;
            t--;
        }
        t /= 2;
    }
}

int main(){
    for(long i=0;i<2*SEG_NUM;++i){
        seg[i] = 0;
    }
    int n, q;
    cin>>n>>q;
    int query, s, t, x;
    for(int i=0;i<q;++i){
        cin>>query;
        if(query){
            cin>>x;
            cout<<find(x)<<endl;;
        }
        else {
            cin>>s>>t>>x;
            update(s, t+1, x);
        }
    }
}

