#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

template<typename Monoid>
struct SegmentTree{
    using F=function<Monoid(Monoid,Monoid)>;
    int sz;
    vector<Monoid> seg;
    const F f;
    const Monoid gen;
    SegmentTree(int n,const F f,const Monoid &gen):f(f),gen(gen){
        sz=1;
        while(sz<n)sz<<=1;
        seg.assign(2*sz,gen);
    }
    void set(int k,const Monoid &x){
        seg[k+sz]=x;
    }
    void build(){
        for(int k=sz-1;k>0;k--) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
    void update(int k,const Monoid &x){
        k+=sz;
        seg[k]=x;
        while(k>>=1) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
   // [a,b)
    Monoid query(int a,int b){
        Monoid L=gen,R=gen;
        for(a+=sz,b+=sz;a<b;a>>=1,b>>=1){
            if(a&1) L=f(L,seg[a++]);
            if(b&1) R=f(seg[--b],R);
        }
        return f(L,R);
    }
    Monoid operator[](const int &k)const {
       return seg[k+sz];
    }
};
pair<ll,ll> f(pair<ll,ll> a,pair<ll,ll> b){
    return make_pair(a.first+b.first,a.second+b.second);
}

struct query{
    int l,r,id;ll x;
    query(int l,int r,ll x,int id):l(l),r(r),x(x),id(id){}
    query(){}
};

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n,q;cin>>n>>q;
    vector<pair<ll,ll>> a(n);
    vector<query> qs;
    rep(i,n){
        ll t;cin>>t;
        a[i]=make_pair(t,i);
    }
    rep(i,q){
        int l,r,unko;ll x;cin>>unko>>l>>r>>x;l--,r--;
        qs.push_back(query(l,r,x,i));
    }
    sort(ALL(qs),[](query a,query b){
        return a.x<b.x;
    });
    vector<ll> ans(q);
    
    SegmentTree<pair<ll,ll>> seg(n,f,make_pair(0,0));
    rep(i,n){
        seg.set(i,make_pair(a[i].first,1));
    }
    seg.build();
    sort(ALL(a));
    int idx=0;

    rep(i,q){
        while(idx<n and a[idx].first<=qs[i].x){
            seg.update(a[idx].second,make_pair(0,0));
            idx++;
        }
        auto p=seg.query(qs[i].l,qs[i].r+1);
        ll res=p.first-p.second*qs[i].x;
        ans[qs[i].id]=res;
    }
    rep(i,q) cout<<ans[i]<<endl;
    return 0;
}