#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
const int INF = 1<<30;

int n;
vector<ll> sum;

ll f(int i, int j){
    return sum[min(n-1,j)] - (i > 0 ? sum[i-1] : 0);
}

struct STmax{
private:
    int n;
    vector<int> dat, dat2;
public:
    STmax(vector<int> ini){
        int siz = ini.size();
        n = 1;
        while(n < siz)   n *= 2;
        dat.resize(2*n-1, -INF);
        dat2.resize(2*n-1, INF);
        for(int i = 0; i < siz; i++)    dat[n - 1 + i] = ini[i], dat2[n-1+i] = ini[i];
        for(int i = n-2; i >= 0; i--)   dat[i] = max(dat[2*i+1], dat[2*i+2]), dat2[i] = min(dat2[2*i+1], dat[2*i+2]);
    }

    // focus on k-th node, who controls [l, r)
    ll query(int a, int b, ll x, int k = 0, int l = 0, int r = -1){
        if(r < 0)   r = n;
        if(r <= a || b <= l)    return 0;
        if(a <= l && r <= b){
            if(dat[k] <= x)  return 0;
            if(dat2[k] >= x){
                return f(l, r-1)-(r-1-l+1)*x;
            }
        }

        ll lx = query(a, b, x, 2*k+1, l, (l+r)/2);
        ll rx = query(a, b, x, 2*k+2, (l+r)/2, r);
        return lx+rx;
    }
};

// 1 3 1 3 1 3...に対して2を投げられたとき死ぬ

int main(){
    int q;
    cin >> n >> q;
    vector<int> a(n);
    for(int i = 0; i < n; i++)  cin >> a[i];
    STmax seg(a);
    sum.resize(n);
    sum[0] = a[0];
    for(int i = 1; i < n; i++)  sum[i] = sum[i-1]+a[i];
    while(q-- > 0){
        int a, l, r, x;
        cin >> a >> l >> r >> x;
        l--, r--;
        cout << seg.query(l, r+1, x) << endl;
    }
    return 0;
}