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<vector>
#include<algorithm>
using namespace std;
typedef long long int ll;

class RAQ{
	public:
	int n;
	vector<ll> dat, dat2;
	RAQ(){}
	RAQ(int size){
		n = 1;
		while(n < size) n *= 2;
		dat.resize(2 * n - 1, 0);
		dat2.resize(2 * n - 1, 0);
	}
	void add(int l, int r, ll x){
		rangeAdd(l, r + 1, x, 0, 0, n);
	}
	void rangeAdd(int a, int b, ll x, int k, int l, int r){
		if(a <= l && r <= b){
			dat[k] += x;
		}else if(l < b && a < r){
			dat2[k] += (min(b, r) - max(a, l)) * x;
			rangeAdd(a, b, x, 2 * k + 1, l, (l + r) / 2);
			rangeAdd(a, b, x, 2 * k + 2, (l + r) / 2, r);
		}
	}
	ll getSum(int s, int t){
		return query(s, t + 1, 0, 0, n);
	}
	ll query(int a, int b, int k, int l, int r){
		if(r <= a || b <= l) return 0;
		if(a <= l && r <= b) return dat[k] * (r - l) + dat2[k];
		else{
			ll ret = (min(b, r) - max(a, l)) * dat[k];
			ll vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
			ll vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
			return ret + vl + vr;
		}
	}
};

int main(){
	int n, q;
	cin >> n >> q;
	RAQ raqa(n);
	for(int i = 0; i < q; i++){
		int com;
		cin >> com;
		if(com == 0){
			int x, y; ll a;
			cin >> x >> y >> a;
			x--; y--;
			raqa.add(x, y, a);
		}else if(com == 1){
			int x;
			cin >> x;
			x--;
			cout << raqa.getSum(x, x) << endl;
		}
	}
	return 0;
}