#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;++i)

using namespace std;

typedef pair<int,int>P;

//?????????????????????0?§???????
//????°????????±???????????????°??????(RMQ)
const int N = 1 << 17;	//10^5?¨????

//?????°???????????¨???????????°??????????????????

int n,n_,q,ad[2*N-1];

//?????????
//n_???x??\??????????°????2????????????
void init(int x)
{
	//?°????????????????????´???°???2???????????????
	n_=1;
	while(n_<x){
		n_*=2;
	}
}

int get(int k)
{
	int res;
	//????????????
	k += n_-1;
	res = ad[k];
	//?????????????????´??°
	while(k>0){
		k = (k-1)/2;
		res += ad[k];
	}
	return res;
}

//[a,b)???????°????????±??????????
//k??????????????????
//????????????query(a,b,0,0,n_)??¨???????????¶???(n_??¨???????????¨?????¨???)
void add(int a,int b,int k,int l,int r,int val)
{
	if(r <= a || b <= l){
		return;
	}
	if(a <= l && r <= b){
		ad[k] += val;
	}else{
		add(a,b,2*k+1,l,(l+r)/2,val);
		add(a,b,2*k+2,(l+r)/2,r,val);
	}
	return;
}

int main()
{
	scanf("%d%d",&n,&q);
	init(n);
	rep(i,q){
		int x;
		scanf("%d",&x);
		if(x == 0){
			int s,t,u;
			scanf("%d%d%d",&s,&t,&u);
			add(s-1,t,0,0,n_,u);
		}else{
			int s;
			scanf("%d",&s);
			printf("%d\n",get(s-1));
		}
	}
	return 0;
}