#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<ll,ll> P;
typedef pair<P,P> PP;

class BIT{
public:
  ll n,bit[555555];
  BIT(){fill(bit,bit+555555,0);}
  void add(ll i,ll x){
    while(i<=n){
      bit[i]+=x;
      i+=i&-i;
    }
  }
  ll sum(ll i){
    ll s=0;
    while(i>0){
      s+=bit[i];
      i-=i&-i;
    }
    return s;
  }
};

BIT b=BIT(),b2=BIT();

void Main() {
  int n,T;
  cin >> n >> T;
  b.n=b2.n=n+1;
  vector<P> v;
  rep(i,n) {
    int x;
    R x;
    v.pb(P(x,i));
  }
  sort(all(v),greater<P>());
  PP p[T];
  rep(i,T) {
    int x;
    cin >> x >> p[i].S.F >> p[i].S.S >> p[i].F.F;
    p[i].F.S=i;
  }
  sort(p,p+T,greater<PP>());
  ll d[T],j=0;
  rep(i,T) {
    ll l=p[i].S.F-1,r=p[i].S.S-1,x=p[i].F.F,k=p[i].F.S;
    while(j<v.size()&&v[j].F>=x) {
      b.add(v[j].S+1,v[j].F);
      b2.add(v[j].S+1,1);
      j++;
    }
    ll s1=b.sum(r+1)-b.sum(l);
    ll s2=b2.sum(r+1)-b2.sum(l);
    d[k]=s1-s2*x;
  }
  rep(i,T) pr(d[i]);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}