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;
#define rep(i,n) for(int i=0;i<n;i++)
#define P pair<int,int>
#define int long long
int n=1;
P dat[444444];
void init(int x){
	while(n<x)n*=2;
}
void eval(int k,int l,int r){
	dat[k].first+=dat[k].second;
	if(r-l>1){
		dat[k*2+1].second+=dat[k].second/2;
		dat[k*2+2].second+=dat[k].second/2;
	}
	dat[k].second=0;
}
void update(int a,int b,int k,int x,int l,int r){
	eval(k,l,r);
	if(r<=a||b<=l)return;
	if(a<=l&&r<=b){
		dat[k].second+=(r-l)*x;
		eval(k,l,r);
	}
	else{
		update(a,b,k*2+1,x,l,(l+r)/2);
		update(a,b,k*2+2,x,(l+r)/2,r);
	}
}
int query_calc(int a,int k,int l,int r){
	eval(k,l,r);
	if(r-l==1)return dat[k].first;
	if(a<(l+r)/2)return query_calc(a,k*2+1,l,(l+r)/2);
	else return query_calc(a,k*2+2,(l+r)/2,r);
}
int query(int x){
	return query_calc(x,0,0,n);
}
signed main(){
	int N,q;
	cin>>N>>q;
	init(N);
	while(q--){
		int Q;
		cin>>Q;
		if(Q==0){
			int s,t,x;
			cin>>s>>t>>x;
			update(s-1,t,0,x,0,n);
		}
		else{
			int i;
			cin>>i;
			cout<<query(i-1)<<endl;
		}
	}
}
	

