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:
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
/*RMQ  update:O(logN)  query:O(lonN)*/



struct RAQ{
  vector<ll> dat;
  int n;

  //?????????
  RAQ(){};
  RAQ(int n_){
    //????´???°n???2???????????????
    n=1;
    while(n<n_)n*=2;
    dat=vector<ll>(n*2,0);
  }

  //[a,b)???????°????????±???????
  //query(a,b,0,0,n)
  
  void add(int a,int b,int x=0,int k=0,int l=0,int r=-1){
    if(r==-1)r=n;

    if(r<=a||b<=l)return ;
    if(a<=l&&r<=b){
      dat[k]+=x;
      return;
    }
    dat[k*2+1]+=dat[k];
    dat[k*2+2]+=dat[k];
    dat[k]=0;
    add(a,b,x,k*2+1,l,(l+r)/2);
    add(a,b,x,k*2+2,(l+r)/2,r);
  }

  ll find(int a){
    add(a,a+1);
    return dat[a+n-1];
  }
};



int main(){
  int n,q;
  cin>>n>>q;
 
  RAQ raq(n);
  
  while(q--){
    int cmd;
    cin>>cmd;
    if(cmd==0){
      int s,t,x;
      cin>>s>>t>>x;
      raq.add(s-1,t,x);
    }
    else {
      int idx;
      cin>>idx;
      cout <<raq.find(idx-1)<<endl;
    }
  }
  return 0;
}