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>
using namespace std;
typedef long long int ll;
#define INF (1LL<<31)-1
typedef struct RAQ{
ll n;
	vector<ll> a;
	//vector<bool> f;
	void init(int size){
		n = 1;
		while(n<size) n*=2;
		a = vector<ll> (2*n-1,0);
		//f = vector<bool> (2*n-1,true);
	}
	
	void init(vector<ll> &b){
		int size = b.size();
		n = 1;
		while(n<size)n*=2;
		a = vector<ll> (2*n-1,0);
		//f = vector<bool> (n,true);
		for(int i=0;i<size;i++) a[i+n-1] = b[i];
	}
	//
	void update(ll aa,ll b ,ll k,ll l,ll r ,ll x){
		if(r<= aa|| b<= l)return ;
		if(aa<=l && r<=b ) a[k] += x*(r-l);
		else{
			a[k*2+1] += a[k]/2;
			a[k*2+2] += a[k]/2;
			a[k] = 0;
			update(aa,b,k*2+1,l,(l+r)/2,x);
			update(aa,b,k*2+2,(l+r)/2,r,x);
		}
		return ;
	}
	ll find(ll aa,ll b,ll k,ll l,ll r){
		if(r<=aa|| b<=l) return 0;
		if(aa<=l && r<= b) return a[k];
		a[k*2+1] += a[k]/2;
		a[k*2+2] += a[k]/2;
		a[k] = 0;
		return find(aa,b,k*2+1,l,(l+r)/2) + find(aa,b,k*2+2,(l+r)/2,r) ;
	}
	//[s,t]
	void update(ll s,ll t,ll x){
		update(s,t+1,0,0,n,x);
	}
	ll find(ll s){
		return find(s,s+1,0,0,n);
	}
	
}RAQ;



int main(){
	ll n,q;
	cin>>n>>q;
	RAQ seg;
	seg.init(n);
	//cout<<seg.a.size()<<endl;
	for(ll i=0;i<q;i++){
		ll d,s,t,x;
		cin>>d;		
		if(d==0){
			cin>>s>>t>>x;
			s--,t--;
			seg.update(s,t,x);
		}else{
			cin>>s;
			s--;
			cout<<seg.find(s)<<endl;
		}
	}

	return 0;
}

