#include<bits/stdc++.h>
#define N 100010
using namespace std;
struct no{
    int v;//value
    int l;//left
    int r;//right
}t[N*4];//存储的是变化值
int n, m;
void build(int i, int l, int r){
    t[i] = {0, l, r};
    if(l == r)return;;
    int mid = (l+r)/2;
    build(2*i, l, mid);
    build(2*i+1, mid+1, r);
}
void pls(int i, int l, int r, int k){
    if(l <= t[i].l && t[i].r <= r){
        t[i].v += k;
        return ;
    }
    if(l <= t[2*i].r){
        pls(2*i, l ,r, k);
    }
    if(t[2*i+1].l <= r){
        pls(2*i+1, l, r, k);
    }
}
int ans = 0;
void query(int i, int p){
    ans += t[i].v;
    if(t[i].l == t[i].r) return ;
    if(p <= t[2*i].r){
        query(2*i, p);
    }
    if(t[2*i+1].l <= p){
        query(2*i+1, p);
    }
}
int main() {
    scanf("%d %d", &n, &m);
    build(1, 1, n);
    for(int i = 0; i < m; i++){
        int op;
        scanf("%d", &op);
        if(op == 0){//区间加
            int b, c, k;
            scanf("%d %d %d", &b, &c, &k);
            pls(1, b, c, k);
        }else if(op == 1){//单点查
            int p;
            scanf("%d", &p);
            ans = 0;
            query(1, p);
            printf("%d\n", ans);
        }
    }
    return 0;
}
