#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>

struct SegmentTree {
    int n;
    vector<ll> s, t; // sum, tag

    SegmentTree(int n_, vector<ll> init) {
        n = n_;
        s.assign(n * 4 + 1, 0); t = s;
        build(1, 1, n, init);
    }

    void push_up(int u) {
        s[u] = s[u * 2] + s[u * 2 + 1];
    }

    void build(int u, int l, int r, vector<ll> &init) {
        if (l == r) {
            s[u] = init[l];
            return;
        }
        int mid = l + r >> 1;
        build(u * 2, l, mid, init);
        build(u * 2 + 1, mid + 1, r, init);
        push_up(u);
    }
    void aply(int u, ll tag, int len) {
        t[u] += tag;
        s[u] += tag * len;
    }
    void push_down(int u, int len) {
        if (t[u] == 0) return;
        aply(u * 2, t[u], len + 1 >> 1);
        aply(u * 2 + 1, t[u], len >> 1);
        t[u] = 0;
    }
    ll query(int u, int l, int r, int x, int y) {
        if (x <= l && y >= r) return s[u];
        push_down(u, r - l + 1);
        int mid = l + r >> 1;
        ll sum = 0;
        if (x <= mid) sum += query(u * 2, l, mid, x, y);
        if (y > mid) sum += query(u * 2 + 1, mid + 1, r, x, y);
        return sum;
    }

    ll query(int l, int r) {
        return query(1, 1, n, l, r);
    }

    void change(int u, int l, int r, int x, int y, ll v) {
        if (x <= l && y >= r) {
            aply(u, v, r - l + 1);
            return;
        }
        push_down(u, r - l + 1);
        int mid = l + r >> 1;
        if (x <= mid) change(u * 2, l, mid, x, y, v);
        if (y > mid) change(u * 2 + 1, mid + 1, r, x, y, v);
        push_up(u);
    }
    void change(int l, int r, ll v) {
        change(1, 1, n, l, r, v);
    }
};
void solve() {
    int n, m;
    cin >> n >> m;

    vector<ll> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    SegmentTree t(n, a);
    while (m--) {
        ll o, x, y, v;
        cin >> o >> x >> y;
        if (o == 2) {
            cout << t.query(x, y) << '\n';
        } else {
            cin >> v;
            t.change(x, y, v);
        }
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    while (t--)
        solve();
    return 0;
}
/*
g++ -std=c++20 1.cpp -o 1 && 1 < in.txt > out.txt
*/