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 <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
  
const ll INF=(1ll<<31)-1;
int a[100001];
int b[1005];
int main(){
    int n,q;
    cin>>n>>q;
    int sqn=sqrt(n);
    int bn=(n+sqn-1)/sqn;
    rep(i,n) a[i]=0;
    rep(i,bn) b[i]=0;
    int com;
    rep(i,q){
        cin>>com;
        if(com==0){
            int s,t,x;
            //[s,t)
            cin>>s>>t>>x;
            --s;
            rep(j,bn){
                int l=j*sqn,r=(j+1)*sqn;
                if(r<=s||t<=l) continue;
                if(s<=l&&r<=t) b[j]+=x;
                else{
                    FOR(k,l,r){
                        if(k>=max(s,l)&&k<min(t,r)) a[k]+=x+b[j];
                        else if(b[j]!=0) a[k]+=b[j];
                    }
                    b[j]=0;
                }
            }
        }
        if(com==1){
            int k;
            cin>>k;
            --k;
            int cur=k/sqn;
            if(b[cur]!=0){
                FOR(j,cur*sqn,(cur+1)*sqn){
                    a[j]+=b[cur];
                }
                b[cur]=0;
            }
            cout<<a[k]<<endl;
        }
    }
    return 0;
}
