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 mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define mkt make_tuple
#define lP pair<ll, ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;

int n, q, s, t, x, u, a[1 << 18];
bool b;

int get(int x) {
	int y = 0;
	x += u;
	while (x) {
		y += a[x];
		x /= 2;
	}
	return y;
}
void add(int s, int t, int x, int k, int l, int r) {
	if (!(r < s || t < l)) {
		if (s <= l&&r <= t)
			a[k] += x;
		else {
			add(s, t, x, k * 2, l, (l + r) / 2);
			add(s, t, x, k * 2 + 1, (l + r) / 2 + 1, r);
		}
	}
}

int main(){
	cin >> n >> q;
	for (int i = 1;; ++i) {
		if ((1 << i) / n >= 2) {
			u = 1 << i - 1;
			break;
		}
	}
	for (int i = 0; i != q; ++i) {
		cin >> b >> s;
		if (b) {
			cout << get(s - 1) << endl;
		}
		else {
			cin >> t >> x;
			add(s - 1, t - 1, x, 1, 0, u - 1);
		}
	}
	return 0;
}

