#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
ll op(ll a,ll b){return max(a,b);}
ll e(){return -1e18;}
ll mpp(ll f,ll x){return f+x;}
ll cmpo(ll f,ll g){return f+g;}
ll id(){return 0;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,Q;cin>>N>>Q;
  vl A(N);cin>>A;
  vl I(Q),X(Q),L(Q),R(Q);
  rep(i,0,Q)cin>>I[i]>>X[i]>>L[i]>>R[i];
  lazy_segtree<ll,op,e,ll,mpp,cmpo,id>seg(N);
  rep(i,0,N)seg.set(i,i);
  rep(q,0,Q){
  	ll l=0,r=N;
  	while(r-l>1){
  		ll m=(l+r)/2;
  		if(seg.get(m)>=I[q])r=m;
  		else l=m;
   	}
   	//seg[l]<I[q]<=seg[r]
   	seg.apply(r,N,1);
  }
  fenwick_tree<ll>F(N+Q);
  rep(i,0,N+Q)F.add(i,1);
  vl LAST(N);
  rep(i,0,N)LAST[i]=seg.get(i);
  vl P(Q);
  rrep(q,0,Q){
  	ll l=0,r=N+Q;
  	while(r-l>1){
  		ll m=(l+r)/2;
  		if(F.sum(0,m)>I[q])r=m;
  		else l=m;
  	}
  	//[0,l)にI[q]個以下,[0,l]にI[q]+1個
  	P[q]=l;
  	F.add(l,-1);
  }
  fenwick_tree<ll>G(N+Q);
  rep(i,0,N)G.add(LAST[i],A[i]);
  rep(q,0,Q){
  	F.add(P[q],1);
  	G.add(P[q],X[q]);
  	ll ans=0;
  	{
  		ll l=-1,r=N+Q;
  		while(r-l>1){
  			ll m=(l+r)/2;
  			if(F.sum(0,m)>=R[q])r=m;
  			else l=m;
  		}
  		ans+=G.sum(0,r);
  	}
  	{
  		ll l=-1,r=N+Q;
  		while(r-l>1){
  			ll m=(l+r)/2;
  			if(F.sum(0,m)>=L[q]-1)r=m;
  			else l=m;
  		}
  		ans-=G.sum(0,r);
  	}
  	cout<<ans<<endl;
  }
  return 0;
}