#include<bits/stdc++.h>
//ios::sync_with_stdio(false);
//cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
    if(a<b)return b;
    else return a;
}
ll lmin(ll a,ll b){
    if(a<b)return a;
    else return b;
}
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll bit[800010];
ll u;
void bitinit(ll n){
    ll y=1;
    rep(i,0,69){
        
        if(y>=n){
            u=y;
            break;
        }
        y*=2;
    }
    fill(bit,bit+u+10,0);
}
void add(ll n,ll x){
    ll i=n;
    bit[i]+=x;
   
    while(i<u){
        i+=i&(-i);
        bit[i]+=x;
        
    }
}
ll bit2[800010];
ll u2;
void bitinit2(ll n){
    ll y=1;
    rep(i,0,69){
        
        if(y>=n){
            u=y;
            break;
        }
        y*=2;
    }
    fill(bit2,bit2+u2+10,0);
}
void add2(ll n,ll x){
    ll i=n;
    bit2[i]+=x;
    
    while(i<u){
        i+=i&(-i);
        bit2[i]+=x;
       
    }
}
ll sum(ll n){
    ll i=n;
    ll ret=0;
    while(i>0){
        ret+=bit[i];
        i-=i&(-i);
       
    }
    return ret;
}
ll sum2(ll n){
    ll i=n;
    ll ret=0;
    while(i>0){
        ret+=bit2[i];
        i-=i&(-i);
        
    }
    return ret;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n,q;cin>>n>>q;
    bitinit(n);
    bitinit2(n);
    vector<pll> v;
    rep(i,1,n+1){
        ll a;cin>>a;
        v.push_back({a,i});
    }
    sort(v.begin(),v.end(),greater<pll>());
    ll l[q],r[q],x[q];
    vector<pll> w;
    rep(i,0,q){
        ll ff;cin>>ff;
        cin>>l[i]>>r[i]>>x[i];
        w.push_back({x[i],i});
    }
    sort(w.begin(),w.end(),greater<pll>());
    ll now=0;
    ll ans[q];
    set<ll> st;
    rep(i,0,w.size()){
        ll nl=l[w[i].second];
        ll nr=r[w[i].second];
        ll nx=x[w[i].second];
        while(now<n&&v[now].first>=nx){
            add(v[now].second,v[now].first);
            add2(v[now].second,1);
            now++;
        }
        ll ss=sum(nr)-sum(nl-1);
        ll tt=sum2(nr)-sum2(nl-1);
        ss-=tt*nx;
        ans[w[i].second]=ss;
    }
    rep(i,0,q)cout<<ans[i]<<endl;
}