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<cstdio>
#include<vector>
#include<algorithm>
using namespace std;

struct segtree{
  int size;
  vector<int> add;
  segtree(int n){
    size = 1;
    while(size<n) size *= 2;
    add.assign(2*size-1,0);
  }
  void update(int a,int b,int x,int k,int l,int r){
    if(a<=l&&r<=b) add[k] += x;
    else if(b<=l||r<=a) return;
    else{
      update(a,b,x,2*k+1,l,(l+r)/2);
      update(a,b,x,2*k+2,(l+r)/2,r);
    }
  }
  void update(int a,int b,int x){update(a-1,b,x,0,0,size);}
  int query(int i,int k,int l,int r){
    if(i<l||r<=i) return 0;
    int ret = 0;
    if(l<=i&&i<r) ret += add[k];
    if(k<size-1) ret += query(i,2*k+1,l,(l+r)/2) + query(i,2*k+2,(l+r)/2,r);
    return ret;
  }
  int query(int i){return query(i-1,0,0,size);}
};

int main(){
  int n,q;
  scanf("%d %d",&n,&q);
  segtree st(n);
  for(int i=0;i<q;i++){
    int cmd;
    scanf("%d",&cmd);
    if(cmd==0){
      int s,t,x;
      scanf("%d %d %d",&s,&t,&x);
      st.update(s,t,x);
    }else if(cmd==1){
      int i;
      scanf("%d",&i);
      printf("%d\n",st.query(i));
    }
  }
  return 0;
}