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:
// add(s,t,x): a[s],a[s+1],...,a[t] にxを加算する
// get(i): a[i]の値を出力する
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int sqrtN = 512;

struct SqrtDecomposition{

    int N, K;             //データ数, バケット数
    vector<int> data;
    vector<int> bucketAdd;
    SqrtDecomposition(int n) : N(n) {
        K = (N + sqrtN - 1) / sqrtN;
        data.assign(K * sqrtN, 0);
        bucketAdd.assign(K, 0);
    }

    // [s, t)
    void add(int s, int t, int x){

        for(int k = 0; k < K; k++){
            int l = k * sqrtN;
            int r = (k + 1) * sqrtN;

            if(r <= s || t <= l) continue;
            
            if(s <= l && r <= t) bucketAdd[k] += x;
            else{
                for(int i = max(s, l); i < min(t, r); i++){
                    data[i] += x;
                }
            }
        }
    }

    int get(int i){
        int k = i / sqrtN;
        return data[i] + bucketAdd[k];
    }
};

signed main(){
    
    int N, Q;
    cin >> N >> Q;
    SqrtDecomposition decomp(N);
    while(Q--){
    int c; cin >> c;
    if(c == 0){
        int s, t, x; cin >> s >> t >> x;
        decomp.add(s, t + 1, x);
    }else{
        int i; cin >> i;
        cout << decomp.get(i) << endl;
    }
  }

  return 0;
}