#include <cstdio>


const int MAXN=1e5+10;

struct Node{
    int lbound,rbound;
    int diff;
    Node *left,*right;
};

Node segtree[MAXN*2];
Node* next_pos=segtree;
int n,q;

Node* build(int left,int right){
    auto* cur=next_pos;
    next_pos++;
    cur->lbound=left;
    cur->rbound=right;
    cur->diff=0;
    int mid=(left+right)/2;
    if (right-left==1) return cur;
    cur->left=build(left,mid);
    cur->right=build(mid,right);
    return cur;
}

void update(Node& self,int l,int r,int u){
    // puts("s");
    int mid=(self.lbound+self.rbound)/2;
    if (l==self.lbound&&r==self.rbound){
        self.diff+=u;
    }else if (l>=mid){
        update(*self.right,l,r,u);
    }else if (r<=mid){
        update(*self.left,l,r,u);
    }else{
        update(*self.left,l,mid,u);
        update(*self.right,mid,r,u);
    }
}

int query(Node& self,int i){
    // puts("q");
    if (self.rbound-self.lbound==1&&self.lbound==i) return self.diff;
    int mid=(self.lbound+self.rbound)/2;
    if (i>=mid) return query(*self.right,i)+self.diff;
    else return query(*self.left,i)+self.diff;
}

int main(){
    scanf("%d%d",&n,&q);
    build(1,n+1);
    for(int i=0;i<q;i++){
        int t;
        scanf("%d",&t);
        if (t==0){
            int s,t,x;
            scanf("%d%d%d",&s,&t,&x);
            update(segtree[0],s,t+1,x);
        }else{
            int i;
            scanf("%d",&i);
            printf("%d\n",query(segtree[0],i));
        }

    }
    return 0;
}
