#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
ll a[MAXN];
struct SegmentTree
{
    #define ls (id << 1)
    #define rs (id << 1 | 1)
    struct Segment
    {
        int  l, r;
        ll val;
    }seg[MAXN << 2];
    void merge(int id)
    {
        seg[id].val = seg[ls].val + seg[rs].val;
    }
    void build(int id, int l, int r)
    {
        if (l == r)
        {
            seg[id].val = a[l];
            return;
        }
        int mid = (l + r) / 2;
        build(ls, l, mid), build(rs, mid + 1, r);
        merge(id);
    }
    ll query(int id, int l, int r)
    {
        if (seg[id].l > r || seg[id].r < l)
        {
            return 0;
        }
        if (seg[id].l >= l && seg[id].r <= r)
        {
            return seg[id].val;
        }
        return query(ls, l, r) + query(rs, l, r);
    }
    void change(int id, int l, int r, int k)
    {
        if (seg[id].l > r || seg[id].r < l)
        {
            return;
        }
        if (seg[id].l >= l && seg[id].r <= r)
        {
            seg[id].val += k;
        }
        change(ls, l, r, k), change(rs, l, r, k);
    }
}SGT;
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    SGT.build(1, 1, n);
    while (m--)
    {
        int op;
        cin >> op;
        if (op == 1)
        {
            int x, y, k;
            cin >> x >> y >> k;
            SGT.change(1, x, y, k);
        }
        else
        {
            int l, r;
            cin >> l >> r;
            cout << SGT.query(1, l, r) << endl;
        }
    }
    return 0;
}