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 int long long
using namespace std;
int input() {
	int r;
	scanf("%lld", &r);
	return r;
}
int t1[123456], t2[12345], t3[1234], t4[123], t5[12];
signed main() {
	int n = input(), q = input();
	while (q--) {
		int k = input();
		if (k == 0) {//add
			int s = input(), t = input(), x = input(); s--;
			while (s < t) {
				if (s % 10000 == 0 && s + 10000 <= t) {
					t5[s / 10000] += x;
					s += 10000;
				}
				else if (s % 1000 == 0 && s + 1000 <= t) {
					t4[s / 1000] += x;
					s += 1000;
				}
				else if (s % 100 == 0 && s + 100 <= t) {
					t3[s / 100] += x;
					s += 100;
				}
				else if (s % 10 == 0 && s + 10 <= t) {
					t2[s / 10] += x;
					s += 10;
				}
				else {
					t1[s] += x;
					s++;
				}
			}
		}
		else {//get
			int i = input(); i--;
			cout << t1[i] + t2[i / 10] + t3[i / 100] + t4[i / 1000] + t5[i / 10000] << endl;
		}
	}
}
