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

struct Query{
  int c, s, t, x, i;
  Query(int c, int s, int t, int x) : c(c), s(s), t(t), x(x){}
  Query(int c, int i) : c(c), i(i){}
};
vector<Query> query;


#define SEG_LEN (1 << 18)

int seg[SEG_LEN * 2];

int get(int i){
  i += SEG_LEN; 
  
  int ans = seg[i];
  while(true){
    i /= 2;
    if(i == 0)break;
    ans += seg[i];
  }
  return ans;
}

void add(int l, int r, int x){
  l += SEG_LEN;
  r += SEG_LEN;

  while(l < r){
    if(l % 2){
      seg[l] += x; 
      ++l; 
    }
    l /= 2;
    if(r % 2){
      seg[r - 1] += x;
      --r; 
    }
    r /= 2;
  }
}

int main(){
  int n, q, c, s, t, x, i;
  cin >> n >> q;
  for(int _ = 0; _ < q; ++_){
    cin >> c;
    if(c == 0){
      cin >> s >> t >> x;
      query.push_back(Query(c, s, t, x));
    }
    else{
      cin >> i;
      query.push_back(Query(c, i));
    }
  }

  for(auto qry : query){
    if(qry.c == 0)add(qry.s, qry.t + 1, qry.x);
    else cout << get(qry.i) << endl;
  }

  return 0;
}

