//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    vi a(n);
    int m = sqrt(n);
    vi b((n+m-1)/m);

    auto add = [&](int s, int t, int x) {
        if(s/m == t/m) {
            for(int i = s; i != t; i++) {
                a[i] += x;
            }
        } else {
            for(; s%m; a[s++] += x);
            for(; t%m; a[--t] += x);
            for(s /= m, t /= m; s != t; b[s++] += x);
        }
    };
    auto get = [&](int i) {
        int res = 0;
        res += a[i];
        res += b[i/m];
        return res;
    };

    while(q--) {
        int t;
        cin >> t;
        if(t) {
            int i;
            cin >> i;
            cout << get(i-1) << '\n';
        } else {
            int s, t, x;
            cin >> s >> t >> x;
            add(s-1, t, x);
        }
    }
}
