#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;

const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;

#define N (1<<18)
template<class T>
struct RMQ{
	pair<T,int>dat[2*N];
	T inf;
	function<pair<T,int>(pair<T,int>,pair<T,int>)>merge;
	RMQ(T Inf,function<pair<T,int>(pair<T,int>,pair<T,int>)>Merge){
		inf=Inf;merge=Merge;
		rep(i,2*N-1){
			dat[i].first=inf;
			dat[i].second=0;
		}
	}
	void update(int k,pair<T,int> x){
		k+=N-1;
		dat[k]=x;
		while(k){
			k=(k-1)/2;
			dat[k]=merge(dat[k*2+1],dat[k*2+2]);
		}
	}
	pair<T,int>query(int a,int b,int k=0,int l=0,int r=N){
		if(b<=l||r<=a)return make_pair(inf,0);
		if(a<=l&&r<=b)return dat[k];
		auto lb=query(a,b,k*2+1,l,(l+r)/2);
		auto rb=query(a,b,k*2+2,(l+r)/2,r);
		return merge(lb,rb);
	}
	T getValue(int a,int b){
		return query(a,b).first;
	}
	int getIndex(int a,int b){
		return query(a,b).second;
	}
};
template<class T>
pair<T,int>RangeMax(pair<T,int>a,pair<T,int>b){
	return a.first>=b.first?a:b;
}
template<class T>
pair<T,int>RangeMin(pair<T,int>a,pair<T,int>b){
	return a.first<=b.first?a:b;
}
template<class T>
pair<T,int>RangeSum(pair<T,int>a,pair<T,int>b){
	return {a.first+b.first,a.second+b.second};
}
RMQ<ll>seg(0,RangeSum<ll>);
P a[200000];
struct st{
	int l,r,x,id;
}q[200000];

ll ans[200000];
int main(){
	int n,Q;cin>>n>>Q;
	rep(i,n){
		scanf("%d",&a[i].first);
		a[i].second=i;
	}
	rep(i,Q){
		scanf("%*d%d%d%d",&q[i].l,&q[i].r,&q[i].x);q[i].l--;
		q[i].id=i;
	}
	sort(a,a+n,greater<>());
	sort(q,q+Q,[](st a,st b){return a.x>b.x;});
	int s=0;
	rep(i,Q){
		while(a[s].first>=q[i].x){
			seg.update(a[s].second,make_pair(a[s].first,1));
			s++;
		}
		ans[q[i].id]=seg.getValue(q[i].l,q[i].r)-seg.getIndex(q[i].l,q[i].r)*(ll)q[i].x;
	}
	rep(i,Q){
		printf("%lld\n",ans[i]);
	}
}