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

template<typename T>
struct Segtree {
    int n;
    T e;
    vector<T> dat;
    typedef function<T(T a, T b)> Func;
    Func f;

    Segtree(){}
    Segtree(int n_input, Func f_input, T e_input){
        initialize(n_input, f_input, e_input);
    }
    void initialize(int n_input, Func f_input, T e_input){
        f = f_input;
        e = e_input;
        n = 1;
        while(n < n_input) n <<= 1;
        dat.resize(2*n-1, e);
    }

    void update(int k, T a){
        k += n - 1;
        dat[k] = a;
        while(k > 0){
            k = (k - 1)/2;
            dat[k] = f(dat[2*k+1], dat[2*k+2]);
        }
    }

    T get(int k){
        return dat[k+n-1];
    }

    T between(int a, int b){
        return query(a, b+1, 0, 0, n);
    }

    T query(int a, int b, int k, int l, int r){
        if(r<=a || b<=l) return e;
        if(a<=l && r<=b) return dat[k];
        T vl = query(a, b, 2*k+1, l, (l+r)/2);
        T vr = query(a, b, 2*k+2, (l+r)/2, r);
        return f(vl, vr);
    }
};

int main(){
    int N, Q;
    cin >> N >> Q;
    vector<vector<int>> ev;
    for(int i=0; i<N; i++){
        int a;
        cin >> a;
        ev.push_back({a, 0, i});
    }
    for(int i=0; i<Q; i++){
        int t, l, r, x;
        cin >> t >> l >> r >> x;
        ev.push_back({x, 1, l-1, r-1, i});
    }
    sort(ev.rbegin(), ev.rend());
    vector<int64_t> ans(Q);

    Segtree<int64_t> stval(N, [](int64_t a, int64_t b){ return a+b; }, 0);
    Segtree<int64_t> stnum(N, [](int64_t a, int64_t b){ return a+b; }, 0);
    for(auto& v : ev){
        if(v[1]){
            int x = v[0], l = v[2], r = v[3], i = v[4];
             ans[i] = stval.between(l, r) - x * stnum.between(l, r);
        }else{
            int a = v[0], i = v[2];
            stval.update(i, a);
            stnum.update(i, 1);
        }
    }
    for(int64_t a : ans) cout << a << endl;
    return 0;
}