#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define ll long long
int n, q, n2;
vector<ll> node, lazy;

void eval(int k, int l, int r){
    node[k] += lazy[k];
    if(r - l > 1){
        lazy[k * 2 + 1] += lazy[k] / 2;
        lazy[k * 2 + 2] += lazy[k] / 2;
    }
    lazy[k] = 0;
}

void add(int a, int b, ll x, int k = 0, int l = 0, int r = -1){
    if(r < 0) r = n2;

    eval(k, l, r);

    if(b <= l || r <= a) return;
    if(a <= l && r <= b){
        lazy[k] += x *(ll)(r - l);
        eval(k, l, r);
        return;
    }
    add(a, b, x, k * 2 + 1, l, (l + r) / 2);
    add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}

ll get(int a, int b, int k = 0, int l = 0, int r = -1){
    if(r < 0) r = n2;

    eval(k, l, r);
    if(b <= l || r <= a) return 0;
    if(a <= l && r <= b) return node[k];
    ll vl = get(a, b, k * 2 + 1, l, (l + r) / 2);
    ll vr = get(a, b, k * 2 + 2, (l + r) / 2, r);
    return vl + vr;
}

void init(){
    cin >> n >> q;
    n2 = 1;
    while(n2 < n) n2 <<= 1;
    node.resize(n2 * 2);
    lazy.resize(n2 * 2);
}

void solve(){
    for(int i= 0; i < q; i++){
        int query;
        cin >> query;
        if(query){
            int g;
            cin >> g;
            cout << get(g - 1, g) << endl;
        }else{
            int s, t, x;
            cin >> s >> t >> x;
            add(s - 1, t, x);
        }
    }
}

int main(){
    init();
    solve();
    return 0;
}
