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;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//(a+b-1)/b

#define len (1<<18)
vi seg(len*2,0);

int get(int ind){
	ind+=len;
	int ans=0;
	while(true){
		if(ind==0)break;
		ans+=seg[ind];
		ind/=2;
	}
	return ans;
}

void add(int l,int r,int x){
	l+=len; r+=len;
	while(l<r){
		if(l%2==1){
			seg[l]+=x;
			l++;
		}
		l/=2;
		if(r%2==1){
			seg[r-1]+=x;
			--r;
		}
		r/=2;
	}
}

signed main(){
	int n,q; cin>>n>>q;
	vi ans(0);
	rep(i,0,q){
		int com; cin>>com;
		if(com==0){
			int l,r,x; cin>>l>>r>>x;
			add(l,r+1,x);
		}
		if(com==1){
			int ind; cin>>ind;
			ans.push_back(get(ind));
		}
	}
	rep(i,0,ans.size())cout<<ans[i]<<endl;
	return 0;
}
