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 MAXN 100005
using namespace std;
int bit[MAXN];
int n;

void add(int s,int t,int x) {
  while (t) {
    bit[t]+=x;
    t-=t&(-t);
  }
  s--;
  while (s) {
    bit[s]+=(-x);
    s-=s&(-s);
  }
}
int get(int i) {
  int ans=0;
  while (i<=n) {
    ans+=bit[i];
    i+=i&(-i);
  }
  return ans;
}
int main() {
  int q;
  cin >> n >> q;
  while (q--) {
    int f;
    cin >> f;
    if (f==0) {
      int s, t, x;
      cin >> s >> t >> x;
      add(s,t,x);
    } else {
      int i;
      cin >> i;
      printf("%d\n",get(i));
    }
  }
  return 0;
}