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 <algorithm>
using namespace std;
typedef long long ll;
struct Segtree{
    
    ll data[1000010],datb[1000010];
    
    Segtree(){
        for(int i=0;i<200010;i++){
            data[i] = 0;
            datb[i] = 0;
        }
    }
    
    void add(int a,int b,int x,int k,int l,int r){
        if(a <= l && r <= b) data[k] += x;
        else if(l <= b && a <= r){
            datb[k] += (min(b,r)-max(a,l)+1) * x;
            add(a,b,x,k*2+1,l,(l+r)/2);
            add(a,b,x,k*2+2,(l+r)/2+1,r);
        }
    }
    
    ll sum(int a,int b,int k,int l,int r){
        if(b < l || r < a) return 0;
        else if(a <= l && r <= b) return data[k]*(r-l+1) + datb[k];
        else {
            ll res = (min(b,r)-max(a,l)+1) * data[k];
            res += sum(a,b,k*2+1,l,(l+r)/2);
            res += sum(a,b,k*2+2,(l+r)/2+1,r);
            return res;
        }
    }
    
};

Segtree seg;

int main(void){
    int n,q,s,t;
    ll a,x;
    cin >> n >> q;
    for(int i=0;i<q;i++){
        cin >> a;
        if(a == 0){
            cin >> s >> t >> x;
            seg.add(s-1,t-1,x,0,0,n-1);
        } else {
            cin >> s;
            cout << seg.sum(s-1,s-1,0,0,n-1) << endl;
        }
    }
    return(0);
}

