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>

#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;

const int N = 100000;
const int sqrt_N = 317; // sqrt(10^5)

struct SqrtDecomposition{
    int n, K;
    vector<int> bucket_add;
    vector<int> data;

    SqrtDecomposition(int n): n(n) {
        bucket_add.assign(sqrt_N, 0);
        data.assign(N, 0);
        K = (n + sqrt_N - 1) / sqrt_N;
    }

    void add(int s, int t, int x){
        t++;
        for(int k=0;k<K;k++){
            int l = k * sqrt_N, r = (k+1) * sqrt_N;
            if(t < l || r < s) continue;
            if(s <= l&& r <= t){
                bucket_add[k] += x;
            }else{
                for(int i=max(s,l);i<min(t,r);i++){
                    data[i] += x;
                }
            }
        }
    }

    int get(int i){
        return data[i] + bucket_add[i/sqrt_N];
    }
};

int main(){
    int n,nq,q,s,t,x;
    cin >> n >> nq;
    
    SqrtDecomposition sd = SqrtDecomposition(n);
    for(int i=0;i<nq;i++){
        cin >> q;
        if(q){
            cin >> x;
            cout << sd.get(x-1) << endl;
        }else{
            cin >> s >> t >> x;
            sd.add(s-1, t-1, x);
        }
    }
}

