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;

struct SegmentTree
{
  const int INF = 1 << 30;

  vector< int > add;
  int sz;

  SegmentTree(int n)
  {
    sz = 1;
    while(sz < n) sz <<= 1;
    add.assign(2 * sz - 1, 0);
  }

  void update(int a, int b, int x, int k, int l, int r)
  {
    if(a >= r || b <= l) return;
    if(a <= l && r <= b) {
      add[k] += x;
      return;
    }
    update(a, b, x, 2 * k + 1, l, (l + r) >> 1);
    update(a, b, x, 2 * k + 2, (l + r) >> 1, r);
  }

  void rangeadd(int a, int b, int x)
  {
    update(a, b, x, 0, 0, sz);
  }

  int query(int k)
  {
    k += sz - 1;
    int ret = add[k];
    while(k > 0) {
      k = (k - 1) >> 1;
      ret += add[k];
    }
    return (ret);
  }
};

int main()
{
  int N, Q;
  scanf("%d %d", &N, &Q);
  SegmentTree tree(N);
  while(Q--) {
    int t;
    scanf("%d", &t);
    if(t == 0) {
      int s, t, x;
      scanf("%d %d %d", &s, &t, &x);
      tree.rangeadd(--s, t, x);
    } else {
      int i;
      scanf("%d", &i);
      printf("%d\n", tree.query(--i));
    }
  }
}