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 <vector>
using namespace std;


const int Interval = 512;
struct SqrtDecomp{
  typedef long long Type;
  const int n;
  vector<Type> arr,buc;
  const Type ide;

SqrtDecomp(const vector<Type>& init,const Type& ide_) : n(init.size()),ide(ide_),arr(init),buc((int)init.size() / Interval + 10,ide_){ for(int i = 0;i < n;i++){
    }
  }

  void update_inter(int l,int r,Type x){
    while(l < r){
      if(l % Interval == 0 && l + Interval <= r){
        buc[l / Interval] += x;
        l += Interval;
      }
      else{
        arr[l] += x;
        l++;
      }
    }
  }

  Type get(int idx){
    return arr[idx] + buc[idx / Interval];
  }
};
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()
int main(){
  int n,q;
  cin >> n >> q;
  SqrtDecomp srd(vector<i64>(n,0),0);
  vector<i64> ans;
  for(int i = 0;i < q;i++){
    i64 com;
    cin >> com;
    if(com == 0){
      int s,t;
      i64 x;
      cin >> s >> t >> x;
      srd.update_inter(s - 1,t,x);
    }
    else{
      int s;
      cin >> s;
      ans.push_back(srd.get(s - 1));
    }
  }

  for(int i = 0;i < ans.size();i++){
    cout << ans[i] << endl;
  }
}

