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>
using namespace std;
#define int long long
int N, Q;
vector<int> bit;

int get(int i){
  int s = 0;
  while(i < bit.size()){
    s += bit[i];
    i += i & -i;
  }
  return s;
}

void add(int i, int x){
  while(i > 0){
    bit[i] += x;
    i -= i & -i;
  }
}

signed main(){
  cin >> N >> Q;
  bit.resize(N + 1);
  for(int i = 0; i < Q; i++){
    int a; cin >> a;
    if(a == 0){
      int b, c, d; cin >> b >> c >> d;
      add(c, d); add(b - 1, -d);
    }
    if(a == 1){
      int b; cin >> b;
      cout << get(b) << endl;
    }
  }
}
