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(i,n) for(int i=0;i<(n);i++)
#define loop(i,x,n) for(int i=(x);i<(n);i++)
#define all(v) (v).begin(),(v).end()
//#define int long long
using namespace std;
const int MOD=1e9+7;
const int INF=1e9;
template<typename T> void cmax(T &a, T b) {a = max(a, b);}
template<typename T> void cmin(T &a, T b) {a = min(a, b);}


int inf=pow(2,31)-1;
int size=1;
vector<int> tree;
void init(int n){
  while(size<n)size*=2;
  tree.assign(size*2,0);
}

//Range add Query
void add(int l,int r,int x){
  l+=size,r+=size;
  for(;l<r;l/=2,r/=2){
    if(l%2==1)tree[l++]+=x;
    if(r%2==1)tree[--r]+=x;
  }
  return ;
}

int getvalue(int i){
  i+=size;
  int res=tree[i];
  while(i/=2){
    res+=tree[i];
  }
  return res;
}


int main(){
  int n,q;
  cin>>n>>q;
  init(n);
  rep(i,q){
    int t;
    cin>>t;
    if(t){
      int u;
      cin>>u;
      u--;
      cout<<getvalue(u)<<endl;
    }else{
      int s,t,x;
      cin>>s>>t>>x;
      s--;
      add(s,t,x);
    }
  }
 return 0;
}

