/*
膜拜传奇特级宗师 Afterglow 大神儿
今天在 florr 首页称您为大夏尊贵的大名儿
一股敬佩之情油生然而
您在 florr 为国争光，扬我大夏威名
向您献上最真挚的膜拜！！！
膜拜传奇特级宗师 Afterglow 大神儿，今，一，您，扬。向！
膜拜传奇特级宗师 Afterglow 大神儿，今，一，您，扬。向！
膜拜传奇特级宗师 Afterglow 大神儿，今，一，您，扬。向！
*/
/*
          _____                    _____                     _____                    _____
         /\    \                  /\    \                   /\    \                  /\    \
        /  \    \                /  \    \                 /  \____\                /  \    \
        \   \    \              /    \    \               /   /    /                \   \    \
         \   \    \            /      \    \             /   /    /                  \   \    \
          \   \    \          /   /\   \    \           /   /____/                    \   \    \
           \   \    \        /   /  \   \    \         /    |    |                     \   \    \
            \   \    \      /   /    \   \    \       /     |    |                      \   \    \
             \   \    \    /   /    / \   \    \     /      |    |                       \   \    \
              \   \    \  /   /    /   \   \    \   /       |____|__ _____                \   \    \
_______________\   \____\/   /____/     \   \    \ /   /|            \    \ _______________\   \____\
\                  /    /\   \    \      \   \    \\  / |    _________\____\\                  /    /
 \    ____________/____/  \   \    \      \   \____\\/__|   |    |           \    ____________/____/
  \   \    \               \   \    \     |   |    |    |   |    |            \   \    \
   \   \    \               \   \    \    |   |    |    |   |    |             \   \    \
    \   \    \               \   \    \   |   |____|    |   |    |              \   \    \
     \   \    \               \   \    \  /   /    /    \   |    |               \   \    \
      \   \    \               \   \    \/   /    /      \  |    |                \   \    \
       \   \____\               \   \___/   /    /        \ |    |                 \   \____\
        \  /    /                \         /    /          \|    |                  \  /    /
         \/____/                  \_______/____/            \____|                   \/____/
*/
#define poj
#define zcz
#ifdef poj
//C++
#include<iomanip>
#include<iostream>
//C
#include<cassert>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
//STL
#include<algorithm>
#include<bitset>
#include<functional>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<vector>
//C++11
#if __cplusplus>=201103L
#include<chrono>
#include<random>
#include<unordered_set>
#include<unordered_map>
#endif
#else
#include<bits/stdc++.h>
#endif
using namespace std;
#ifdef zcz
class fastin{
	private:
#ifdef poj
	static const int MAXBF=1<<20;
#else
	const int MAXBF=1<<27;
#endif
	FILE *inf;
	char *inbuf,*inst,*ined;
	inline char _getchar(){
		if(inst==ined)inst=inbuf,ined=inbuf+fread(inbuf,1,MAXBF,inf);
		return inst==ined?EOF:*inst++;
	}
	public:
	fastin(FILE*_inf=stdin){
		inbuf=new char[MAXBF],inf=_inf,inst=inbuf,ined=inbuf;
	}
	~fastin(){delete inbuf;}
	template<typename Int> fastin&operator>>(Int &n){
		static char c;
		Int t=1;
		while((c=_getchar())<'0'||c>'9')if(c=='-')t=-1;
		n=(c^48);
		while((c=_getchar())>='0'&&c<='9')n=n*10+(c^48);
		n*=t;
		return *this;
	}
	fastin&operator>>(char&c){
		while((c=_getchar())<'!'||c>'~');
		return *this;
	}
	fastin&operator>>(char*s){
		int t=0;
		static char c;
		while((c=_getchar())==' '||c=='\n');
		s[t++]=c;
		while((c=_getchar())>='!'&&c<='~')s[t++]=c;
		s[t]='\0';
		return *this;
	}
}fi;
class fastout{
	private:
#ifdef poj
	static const int MAXBF=1<<20;
#else
	const int MAXBF=1<<27;
#endif
	FILE *ouf;
	char *oubuf,*oust,*oued;
	inline void _flush(){fwrite(oubuf,1,oued-oust,ouf);oued=oust;}
	inline void _putchar(char c){
		if(oued==oust+MAXBF)_flush(),oued=oubuf;
		*oued++=c;
		#ifdef local
		_flush();
		#endif
	}
	public:
	fastout(FILE*_ouf=stdout){
		oubuf=new char[MAXBF],ouf=_ouf,oust=oubuf,oued=oubuf;
	}
	~fastout(){_flush();delete oubuf;}
	template<typename Int> fastout&operator<<(Int n){
		if(n<0)_putchar('-'),n=-n;
		static char S[20];
		int t=0;
		do{S[t++]='0'+n%10,n/=10;}while(n);
		for(int i=0;i<t;++i)_putchar(S[t-i-1]);
		return *this;
	}
	fastout&operator<<(char c){_putchar(c);return *this;}
	fastout&operator<<(char*s){
		for(int i=0;s[i];++i)_putchar(s[i]);
		return *this;
	}
	fastout&operator<<(const char*s){
		for(int i=0;s[i];++i)_putchar(s[i]);
		return *this;
	}
}fo;
#define cin fi
#define cout fo
#else
#define czc ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#endif
#define mod7 1000000007
#define mod9 998244353
#define ll long long
#define isinf 0x3f3f3f3f
#define ilinf 0x7fffffff
#define lsinf 0x3f3f3f3f3f3f3f3f
#define llinf 0x7fffffffffffffff
#define pii pair<int,int>
#define fr first
#define sc second
#define next ___
#define pb push_back
#define N 100010
#define M 200010
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b,c) for(int i=(a);i<=(b);i+=c)
#define Per(i,a,b,c) for(int i=(a);i>=(b);i-=c)
#define Gra(i) for(int i=h[x];i;i=next[i])
typedef int arr[N];
typedef int arm[M];
typedef ll arl[N];
typedef ll alm[M];
typedef double ard[N];
typedef double adm[M];
namespace modint{
	template<typename Int,Int mod>
	struct modint{
		Int v;
		modint(){v=0;}
		modint(Int a){v=a;}
		bool operator==(modint a){return v==a.v;}
		bool operator!=(modint a){return v!=a.v;}
		bool operator<(modint a){return v<a.v;}
		bool operator>(modint a){return v>a.v;}
		bool operator<=(modint a){return v<=a.v;}
		bool operator>=(modint a){return v>=a.v;}
		bool operator==(Int a){return v==a;}
		bool operator!=(Int a){return v!=a;}
		bool operator<(Int a){return v<a;}
		bool operator>(Int a){return v>a;}
		bool operator<=(Int a){return v<=a;}
		bool operator>=(Int a){return v>=a;}
		modint operator+(modint a){return v>mod-a.v?v-mod+a.v:v+a.v;}
		modint operator-(modint a){return v>a.v?v-a.v:v+mod-a.v;}
		modint operator*(modint a){return v*a.v%mod;}
		modint operator+=(modint a){*this=*this+a;return *this;}
		modint operator-=(modint a){*this=*this-a;return *this;}
		modint operator*=(modint a){*this=*this*a;return *this;}
		modint qpow(modint a,Int b){
			modint r(1);
			for(;b;b>>=1,a*=a)if(b&1)r*=a;
			return r;
		}
		modint operator/(modint a){return qpow(a,mod-2)*v;}
		modint operator/=(modint a){*this=*this/a;return *this;}
		modint&operator++(){*this=*this+1;return *this;}
		modint&operator--(){*this=*this-1;return *this;}
		const modint operator++(int){modint r=*this;++*this;return r;}
		const modint operator--(int){modint r=*this;--*this;return r;}
		#ifdef cout
		friend fastout&operator<<(fastout&out,modint n){out<<n.v;return out;}
		#else
		friend ostream&operator<<(ostream&out,modint n){out<<n.v;return out;}
		#endif
	};
	typedef modint<long long,1000000007> int7;
	typedef modint<long long,998244353> int9;
}
using namespace modint;
int n,m,q,l,L[320],R[320];
arr a,b,id,e;
arm as;
alm ans;
ll c[320][320],d[320];
struct G{
	int x1,y1,x2,y2;
}s[M];
struct H{
	int i,l,r,v;
};
struct I{
	arr a;
	int b[320];
	void add(int x){
		For(i,x,R[id[x]]){
			++a[i];
		}
		For(i,id[x]+1,l){
			++b[i];
		}
	}
	int ask(int x){
		return a[x]+b[id[x]];
	}
}f;
vector<H>t[N];
vector<pii>u[N];
int bf(int p,int x1,int y1,int x2,int y2){
	if(y1-x1>45){
		int mid=(x1+y1)>>1;
		t[x1-1].pb({p,mid+1,y1,-1});
		t[mid].pb({p,mid+1,y1,1});
		return bf(p,x1,mid,x2,y2)+bf(p,mid+1,y1,x2,y2);
	}
	int ans=0;
	For(i,x1,y1){
		if(a[i]>=x2&&a[i]<=y2){
			For(j,i+1,y1){
				ans+=(a[i]<a[j]&&a[j]<=y2);
			}
		}
	}
	return ans;
}
void solve(){
	cin>>n>>m;
	q=sqrt(n);
	l=(n-1)/q+1;
	For(i,1,l){
		L[i]=R[i-1]+1;
		R[i]=min(i*q,n);
	}
	For(i,1,n){
		cin>>a[i];
		b[a[i]]=i;
		id[i]=(i-1)/q+1;
	}
	For(i,1,m){
		cin>>s[i].x1>>s[i].y1>>s[i].x2>>s[i].y2;
		int bl=id[s[i].x1],br=id[s[i].y1];
		if(bl==br){
			ans[i]=bf(i,s[i].x1,s[i].y1,s[i].x2,s[i].y2);
			continue;
		}
		ans[i]=bf(i,s[i].x1,R[bl],s[i].x2,s[i].y2)+bf(i,L[br],s[i].y1,s[i].x2,s[i].y2);
		t[s[i].x1-1].pb({i,L[br],s[i].y1,-1});
		t[R[br-1]].pb({i,L[br],s[i].y1,1});
		if(br-bl<=1)continue;
		t[R[bl]].pb({i,s[i].x1,R[bl],-1});
		t[R[br-1]].pb({i,s[i].x1,R[bl],1});
		u[s[i].x2-1].pb({i,-1});
		u[s[i].y2].pb({i,1});
	}
	For(i,1,n){
		f.add(a[i]);
		for(H j:t[i]){
			For(k,j.l,j.r){
				int x2=s[j.i].x2,y2=s[j.i].y2;
				if(a[k]<x2||a[k]>y2){
					continue;
				}
				if(k>i){
					y2=min(y2,a[k]-1);
				}else{
					x2=max(x2,a[k]+1);
				}
				ans[j.i]+=(f.ask(y2)-f.ask(x2-1))*j.v;
			}
		}
	}
	For(i,1,n){
		int j=b[i],k=0;
		++d[id[j]];
		Per(l,id[j]-1,1,1){
			k+=d[l];
			c[l][id[j]]+=k;
		}
		for(pii x:u[i]){
			int l=id[s[x.fr].x1]+1,r=id[s[x.fr].y1]-1;
			For(o,l+1,r){
				ans[x.fr]+=c[l][o]*x.sc;
			}
		}
	}
	For(i,1,l){
		int lp=L[i],rp=R[i];
		For(j,1,n){
			e[j]=e[j-1]+(b[j]>=lp&&b[j]<=rp);
		}
		memset(c,0,sizeof(c));
		For(j,lp,rp){
			For(k,j+1,rp){
				c[e[a[j]]][e[a[k]]]+=a[j]<=a[k];
			}
		}
		Per(j,e[n],1,1){
			For(k,j,e[n]){
				c[j][k]+=c[j+1][k]+c[j][k-1]-c[j+1][k-1];
			}
		}
		For(j,1,m){
			if(id[s[j].x1]<i&&i<id[s[j].y1]){
				ans[j]+=c[e[s[j].x2-1]+1][e[s[j].y2]]-1ll*as[j]*(e[s[j].y2]-e[s[j].x2-1]);
				as[j]+=e[s[j].x2-1];
			}
		}
	}
	For(i,1,m){
		cout<<ans[i]<<'\n';
	}
	return;
}
int main(){
	#ifndef zcz
	czc;
	#endif
	#ifdef local
//	freopen("tears7.in","r",stdin);
//	freopen("tears7.out","w",stdout);
	int t1=clock();
	#endif
	int t=1;
	while(t--)solve();
	#ifdef local
	cerr<<clock()-t1;
	#endif
	return 0;
}