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;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
int bit[100010];
int n,q;
void range_add(int loc,int x){
    while(loc){
        bit[loc]+=x;
        loc-=loc&-loc;
    }
}
int get(int loc){
    int res=0;
    while(loc<=n){
        res+=bit[loc];
        loc+=loc&-loc;
    }
    return res;
}
int main(){
    cin >> n >> q;
    for(int i=0;i<q;i++){
        int query;cin >> query;
        if(query==0){
            int s,t,x;cin >> s >> t >> x;
            range_add(t,x);
            range_add(s-1,-x);
        }
        else{
            int i;cin >> i;
            cout << get(i) << endl;
        }
    }
    return 0;
}
