#include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
#include <functional>
using namespace std;

template<typename Monoid>
struct SegmentTree {
    using F = function<Monoid(Monoid, Monoid)>;
    const F f;
    const Monoid M1;
    int sz;
    vector<Monoid> dat;
    SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), sz(1) {
        while (sz < n) sz <<= 1;
        dat.assign(sz * 2, M1);
    }
    void set(int k, const Monoid &x) { dat[k + sz] = x; }
    void build() {
        for (int k = sz - 1; k > 0; k--) {
            dat[k] = f(dat[2 * k], dat[2 * k + 1]);
        }
    }
    void update(int k, const Monoid &x) {
        dat[k += sz] = x;
        while (k >>= 1) dat[k] = f(dat[2 * k], dat[2 * k + 1]);
    }
    Monoid get(int a, int b) {  // [a, b)
        Monoid L = M1, R = M1;
        for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if (a & 1) L = f(L, dat[a++]);
            if (b & 1) R = f(dat[--b], R);
        }
        return f(L, R);
    }
    Monoid operator[](const int &k) const { return dat[k + sz]; }
    friend ostream& operator<<(ostream& os, SegmentTree<Monoid> &seg) {
        for (int i = 0; i < seg.sz; i++) os << seg[i] << " ";
        return os;
    }
};

int main() {
    int n, q; cin >> n >> q;
    vector<int> a(n);
    for (int &ai: a) cin >> ai;
    vector<int> l(q), r(q), x(q);
    for (int i = 0; i < q; i++) {
        int _; cin >> _ >> l[i] >> r[i] >> x[i]; l[i]--;
    }
    vector<int> ord(n + q);
    iota(ord.begin(), ord.end(), 0);
    auto comp = [&](int s, int t) {
        #define g(i) (i < n ? a[i] : x[i - n])
        return g(s) > g(t);
    };
    sort(ord.begin(), ord.end(), comp);
    auto f = [](int a, int b) { return a + b; };
    SegmentTree<int> num(n, f, 0), sum(n, f, 0);
    vector<int> ans(q);
    for (int i: ord) {
        if (i < n) {
            num.update(i, 1);
            sum.update(i, a[i]);
        } else {
            i -= n;
            ans[i] = sum.get(l[i], r[i]) - num.get(l[i], r[i]) * x[i];
        }
    }
    for (int i = 0; i < q; i++) cout << ans[i] << endl;
    return 0;
}