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 <iostream>
#include <climits>
#include <vector>
#include <algorithm>
using namespace std;

void lazy_add(int k,vector<int>& node,vector<int>& lazy,int n) {
	node[k] += lazy[k];
	if (k < n - 1) {//n - 1
		lazy[2 * k + 1] += lazy[k];
		lazy[2 * k + 2] += lazy[k];
	}
	lazy[k] = 0;
}

void add(int a, int b, int x, int k, int l, int r,vector<int>&node, vector<int>& lazy,int n) {
	if (r <= a || b <= l)return;
	if (a <= l && r <= b) {
		lazy[k] += x; 
		lazy_add(k, node, lazy,n);
		return;
	}
	else {
		lazy_add(k, node, lazy, n);
		add(a, b, x, 2 * k + 1, l, (l + r) / 2, node, lazy, n);
		add(a, b, x, 2 * k + 2, (l + r) / 2, r, node, lazy, n);
		return;
	}
}

int get(int x, vector<int>& node, vector<int>& lazy,int n) {
	add(x, x + 1, 0, 0, 0, n, node, lazy, n);
	return node[n - 1 + x];
}

int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int n_, q;  cin >> n_ >> q;
	int n = 1;
	while (n < n_) n *= 2;
	vector<int> node(2 * n - 1, 0);
	vector<int> lazy(2 * n - 1, 0);

	for (int i = 0; i < q; i++) {
		int com; cin >> com;
		if (com == 0) {
			int s, t, x; cin >> s >> t >> x;
			add(s - 1, t, x, 0, 0, n, node, lazy, n);
		}
		else {
			int x; cin >> x;
			cout << get(x - 1, node, lazy, n) << endl;
		}
	}
}