#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string.h>
#define rep(i,n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
double PI = 3.1415926535897932;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;

// 区間和、要素更新のsegtree

template<typename T>
struct segtree {
    int n;
    vector<T> dat;

    void init(int n_){
        n = 1;
        while(n < n_) n *= 2;
        dat.assign(2*n-1, 0);
    }

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

    //(a,b,0,0,seg.n)で呼ぶ
    T query(int a, int b, int k, int l, int r){
        if(r <= a || b <= l) return 0;
        if(a <= l && r <= b) return dat[k];
        else{
            T vl = query(a,b,k*2+1,l,(l+r)/2);
            T vr = query(a,b,k*2+2,(l+r)/2,r);
            return vl + vr;
        }
    }
};

segtree<ll> seg_v, seg_c;
int n, q;
pl a[100000];
ll ans[100000];

struct Q {
    int l, r, x, i;

    bool operator>(const Q &r) const {
        return x > r.x;
    }
} qu[100000];

int main() {
    cin >> n >> q;
    seg_v.init(n);
    seg_c.init(n);
    rep(i,n) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a, a+n, greater<pl>());
    rep(i,q) {
        ll f, l, r, x;
        cin >> f >> l >> r >> x;
        l--; r--;
        qu[i].l = l; qu[i].r = r; qu[i].x = x; qu[i].i = i;
    }
    sort(qu, qu+q, greater<Q>());
    int pos = 0;
    rep(i,q) {
        while (pos < n && qu[i].x <= a[pos].first) {
            seg_c.update(a[pos].second, 1);
            seg_v.update(a[pos].second, a[pos].first);
            pos++;
        }
        ll cnt = seg_c.query(qu[i].l, qu[i].r+1, 0, 0, seg_c.n);
        ll val = seg_v.query(qu[i].l, qu[i].r+1, 0, 0, seg_v.n);
        ans[qu[i].i] = val - cnt*qu[i].x;
    }
    rep(i,q) {
        cout << ans[i] << endl;
    }
}