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 <iostream>
using namespace std;

int n,q;
int dat[300000];

void init(){
	int nn = 1;
	while(nn < n) nn *= 2;
	n = nn;
	for(int i = 0;i < n * 2 - 1;i++){
		dat[i] = 0;
	}
}

void update(int a,int b,int x,int k,int l,int r){
	if(r <= a || b <= l) return;
	if(a <= l && r <= b){
		dat[k] += x;
		return;
	}
	update(a,b,x,k * 2 + 1,l,(l + r) / 2);
	update(a,b,x,k * 2 + 2,(l + r) / 2,r);
}

int get(int i){
	i = i + n - 1;
	int sum = dat[i];
	while(i){
		i = (i - 1) / 2;
		sum += dat[i];
	}
	return sum;
}

int main(){
	cin >> n >> q;
	init();
	for(int i = 0;i < q;i++){
		int v;
		cin >> v;
		if(v == 0){
			int s,t,x;
			cin >> s >> t >> x;
			update(s - 1,t,x,0,0,n);
		}
		else{
			int x;
			cin >> x;
			cout << get(x - 1) << endl;
		}
	}
	return 0;
}