A

#include <iostream>
#define int long long
using namespace std;

const int N = 2e5 + 5;


int n, q, a[N];
int t[4*N];

void build(int v, int vl, int vr) {
    if (vl == vr) {
        t[v] = a[vl];
        return;
    }
    int vm = (vl + vr) / 2;
    build(2 * v, vl, vm);
    build(2 * v + 1, vm + 1, vr);

    ///t[v] = 0;
}

int get(int v, int vl, int vr, int pos) {
    if (vl == vr) {
        ///vl == vr == pos
        return t[v];
    }
    int vm = (vl + vr) / 2;
    if (pos <= vm)
        return get(2 * v, vl, vm, pos) + t[v];
    else
        return get(2 * v + 1, vm + 1, vr, pos) + t[v];
}

void update(int v, int vl, int vr, int l, int r, int x) {
    if (vl == l && vr == r) {
        t[v] += x;
        return;
    }
    int vm = (vl + vr) / 2;
    if (r <= vm)
        update(2 * v, vl, vm, l, r, x);
    else if (l > vm)
        update(2 * v + 1, vm + 1, vr, l, r, x);
    else {
        update(2 * v, vl, vm, l, vm, x);
        update(2 * v + 1, vm + 1, vr, vm + 1, r, x);
    }
}

signed main()
{
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    build(1, 1, n);

    while (q--) {
        int t;
        cin >> t;
        if (t == 1) {
            int l, r, x;
            cin >> l >> r >> x;
            update(1, 1, n, l, r, x);
        } else {
            int pos;
            cin >> pos;
            cout << get(1, 1, n, pos) << "\n";
        }
    }

    return 0;
}