#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const ll INF = (1ll << 60);
typedef pair<ll,ll> pii;

struct RAQ{
  ll size;
  ll *tree;
  RAQ(ll sz){
    ll logsize; for(logsize=0;(1ll<<logsize)<=sz;logsize++);
    size=(1ll<<logsize);
    tree=new ll[size*2-1]; REP(i,size*2-1) tree[i]=0;
  }
  void add(ll s,ll t,ll x){
    add(s,t,0,size,x,0);
  }
  void add(ll s,ll t,ll l,ll r,ll x,ll k){
    if(r<=s||t<=l||r<=l) return;
    if(l+1==r) {tree[k]+=x; return;}
    if(s<=l&&r<=t) {tree[k]+=x; return;}
    ll mid=(l+r+1)/2;
    add(s,t,l,mid,x,k*2+1);
    add(s,t,mid,r,x,k*2+2);
  }
  ll get(ll i){
    ll k=i+size-1;
    ll ret=tree[k];
    while(k){
      k=(k-1)/2;
      ret+=tree[k];
    }
    return ret;
  }
};

int main(){
  ll n,q; cin>>n>>q;
  RAQ raq(n);
  REP(i,q){
    ll com; cin>>com;
    if(com==0) {ll s,t,x; cin>>s>>t>>x; raq.add(s,t+1,x);}
    else {ll t; cin>>t; cout<<raq.get(t)<<endl;}
  }
}

//verified