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;

class SegmentTree {
	const int n;
	const int id = 1;
	vector<int> data;
	int size(int n) {
		int res = 1;
		while (res < n) res <<= 1;
		return res;
	}
	void sub(int l, int r, int node, int lb, int ub, int val) {
		if (ub <= l || r <= lb) return;
		if (l <= lb && ub <= r) {
			data[node] += val;
			return;
		}
		sub(l, r, node * 2, lb, (lb + ub) / 2, val);
		sub(l, r, node * 2 + 1, (lb + ub) / 2, ub, val);
	}
public:
	SegmentTree(int n_) :
		n(size(n_)), data(n * 2, 0) {}
	void add(int l, int r, int val) {
		sub(l, r + 1, 1, 0, n, val);
	}
	int get(int i) {
		i += n;
		int res = data[i];
		while (i >>= 1) {
			res += data[i];
		}
		return res;
	}
};

int main()
{
	int n, q, b, i, s, t, x;
	cin >> n >> q;
	SegmentTree raq(n);
	while (q--) {
		cin >> b;
		if (b) {
			cin >> i;
			cout << raq.get(i - 1) << endl;
		}
		else {
			cin >> s >> t >> x;
			raq.add(s - 1, t - 1, x);
		}
	}
	return 0;
}