#include <bits/stdc++.h>
#define int long long
#define lc (u << 1)
#define rc (u << 1 | 1)
const int N = 1e5 + 10;

int n, m, a[N], d[N];
struct tree {
    int val, add;
}tr[N * 4];
void settag(int u, int val) {
    tr[u].add += val;
    tr[u].val += val;
}
void pushup(int u){
    tr[u].val = tr[lc].val + tr[rc].val;
}
void pushdown(int u){
    if(tr[u].add) {
        settag(lc, tr[u].add);
        settag(rc, tr[u].add);
        tr[u].add = 0;
    }
}
void build(int u, int l, int r) {
    if(l == r) {
        tr[u].val = d[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(lc, l, mid);
    build(rc, mid + 1, r);
    pushup(u);
}
long long query(int u, int l, int r, int ql, int qr) {
    if(l == ql && r == qr) {
        return tr[u].val;
    }
    pushdown(u);
    int mid = (l + r) >> 1;
    if(ql <= mid) return query(lc, l, mid, ql, mid);
    else if(qr > mid) return query(rc, mid + 1, r, mid + 1, qr);
    return query(lc, l, mid, ql, mid) + query(rc, mid + 1, r, mid + 1, qr);
}
void modify(int u, int l, int r, int ql, int qr, int val)  {
    if(l == ql && r == qr) {
        settag(u, val);
        return;
    }
    pushdown(u);
    int mid = (l + r) >> 1;
    if(qr <= mid)  modify(lc, l, mid, ql, qr, val);
    else if(ql > mid) modify(rc, mid + 1, r, ql, qr, val);
    else {
        modify(lc, l, mid, ql, mid, val);
        modify(rc, mid + 1, r, mid + 1, qr, val);
    }
    pushup(u);
}
signed main() {
    std:: cin >> n >> m;
    for(int i = 1; i <= n; i++) std:: cin >> a[i], d[i] = a[i] - a[i - 1];
    build(1, 1, n);
    while(m--) {
        int tp; std:: cin >> tp;
        if(tp == 1){
            int l, r, k, dd; std:: cin >> l >> r >> k >> dd;
            int end = k + (r - l) * dd;
            modify(1, 1, n, l, l, k);
            if(r > l) modify(1, 1, n, l + 1, r, dd);
            if(r < n) modify(1, 1, n, r + 1, r + 1, -end);
        }
        else {
            int x; std:: cin >> x;
            std:: cout << query(1, 1, n, 1, x) << '\n';
        }
    }
}