template<class Info, class Tag>
struct SegmentTree {
    vector<Info> info;
    vector<Tag> tag;
    int n;
    SegmentTree(int n_, const vector<Info> &init) {
        n = n_;
        info.assign(4 * n + 1, {});
        tag.assign(4 * n + 1, {});
        build(1, 1, n, init);
    }

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

    void build(int u, int l, int r, const vector<Info> &init) {
        if (l == r) {
            info[u] = init[l];
            return;
        }
        int m = l + r >> 1;
        build(u * 2, l, m, init);
        build(u * 2 + 1, m + 1, r, init);
        push_up(u);
    }

    void aply(int u, const Tag& t) {
        tag[u].aply(t);
        info[u].aply(t);
    }

    void push_down(int u) {
        aply(u * 2, tag[u]);
        aply(u * 2 + 1, tag[u]);
        tag[u] = {};
    }

    Info query(int u, int ul, int ur, int l, int r) {
        if (l <= ul && ur <= r) {
            return info[u];
        }
        if (r < ul || l > ur) return {};
        int m = ul + ur >> 1;
        push_down(u);
        return query(u * 2, ul, m, l, r) + query(u * 2 + 1, m + 1, ur, l, r);
    }

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

    void change(int u, int ul, int ur, int l, int r, const Tag &y) {
        if (l <= ul && ur <= r) {
            aply(u, y);
            return;
        }
        if (r < ul || l > ur) return;
        push_down(u);
        int m = ur + ul >> 1;
        change(u * 2, ul, m, l, r, y);
        change(u * 2 + 1, m + 1, ur, l, r, y);
        push_up(u);
    }

    void change(int l, int r, const Tag &y) {
        change(1, 1, n, l, r, y);
    }
};

struct Tag {
    ll add;
    void aply(const Tag & t) {
        add += t.add;
    }
};
struct Info {
    ll sum;
    int len;

    void aply(const Tag &t) {
        sum += t.add * len;
    }

    Info operator+ (const Info &t) const {
        return {sum + t.sum, len + t.len};
    }
};
void solve() {
    int n, m;
    cin >> n >> m;

    vector<Info> a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i].sum, a[i].len = 1;

    SegmentTree<Info, Tag> t(n, a);

    while (m--) {
        int o, x, y, v;
        cin >> o >> x >> y;
        if (o == 2) {
            cout << t.query(x, y).sum << '\n';
        } else {
            cin >> v;
            t.change(x, y, (Tag){v});
        }
    }
}