Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

int sid = 1;
struct segtree {
  int l, r, sl, sr, v;
} s[1000005];

int build(int l, int r) {
  int u = sid++;
  int m = l + r >> 1;

  s[u].l = l;
  s[u].r = r;
  s[u].v = 0; // from problem statement

  if (l != r) {
    s[u].sl = build(l, m);
    s[u].sr = build(m + 1, r);
  }
  
  return u;
}

void update(int u, int l, int r, int v) {
  if (l == s[u].l && r == s[u].r) {
    s[u].v += v;
    return;
  }

  int m = s[u].l + s[u].r >> 1;
  if (r <= m) {
    update(s[u].sl, l, r, v);
  } else if (l > m) {
    update(s[u].sr, l, r, v);
  } else {
    update(s[u].sl, l, m, v);
    update(s[u].sr, m + 1, r, v);
  }
}

int query(int u, int k) {
  if (s[u].l == s[u].r) return s[u].v;

  int m = s[u].l + s[u].r >> 1;
  if (k <= m)
    return s[u].v + query(s[u].sl, k);
  else
    return s[u].v + query(s[u].sr, k);
}

int main() {
  int n, q; cin >> n >> q;
  int T = build(1, n);

  for (int i = 0; i < q; i++) {
    int t; cin >> t;
    if (t == 0) {
      int a, b, c; cin >> a >> b >> c;
      update(T, a, b, c);
    } else {
      int k; cin >> k;
      cout << query(T, k) << endl;
    }
  }
}