#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using lint = long long;

struct S {
    lint val, size;
};

S op(S a, S b) {
    return {a.val + b.val, a.size + b.size};
}

S e() {
    return {0LL, 0LL};
}

int main() {
    int n, q;
    cin >> n >> q;
    /*
    更新クエリ
    {x, i, -1, -1}
    取得クエリ
    {x, l, r, i}
    */
    vector<tuple<lint, lint, lint, lint>> tup;
    for (int i = 0; i < n; i++) {
        lint a;
        cin >> a;
        tup.push_back({a, i, -1, -1});
    }
    for (int i = 0; i < q; i++) {
        int t, l, r;
        lint x;
        cin >> t >> l >> r >> x;
        l--;
        r--;
        tup.push_back({x, l, r, i});
    }
    sort(tup.rbegin(), tup.rend());
    segtree<S, op, e> seg(n);
    vector<lint> ans(q);
    for (auto [x, l, r, i] : tup) {
        if (i == -1) {
            seg.set(l, {x, 1LL});
        } else {
            S res = seg.prod(l, r + 1);
            ans[i] = res.val - res.size * x;
        }
    }
    for (int i = 0; i < q; i++) {
        cout << ans[i] << endl;
    }
}