Problem: 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

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;

//Binary Indexed Tree
//1-indexed
class RAQ{
public:
    explicit RAQ(int n):size(n),init(0){//初期値が0のとき-> v[1]=v[2]=...=v[n]=0
        tbl.resize(static_cast<unsigned long>(size + 10),0);
    }
    RAQ(int n,int first):size(n),init(first){//初期値が0以外->v[1]=v[2]=...v[n]=first
        tbl.resize(static_cast<unsigned long>(size + 10), 0);
    }
    void add(int l,int r,int w){//v[l...r]+=w , 1-indexed
        add(l,w);
        add(r+1,-w);
    }
    ll sum(int a){//v[1]+...+v[a]
        ll res=0;
        for(int i=a;i>0;i-=i&-i)res+=tbl[i];
        return res+a*init;
    }
private:
    vector<ll> tbl;
    int size;
    int init=0;
    void add(int a,ll w){
        for(int i=a;i<=size;i+=i&-i)tbl[i]+=w;
    }
};

int main(){
    int n,q;cin>>n>>q;
    RAQ bit(n);
    for(int i=0;i<q;i++){
        int a;cin>>a;
        if(a==0){
            int s,t,x;cin>>s>>t>>x;
            bit.add(s,t,x);
        }else{
            int b;cin>>b;
            cout<<bit.sum(b)<<endl;
        }
    }
    return 0;
}