//Vijos 1923

 #include<vector>

 #include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 using namespace std;

 int getint(){

     int v=,sign=; char ch=getchar();

     while(ch<''||ch>'') {if (ch=='-') sign=-; ch=getchar();}

     while(ch>=''&&ch<='') {v=v*+ch-''; ch=getchar();}

     return v*=sign;

 }

 #define debug

 /*******************tamplate********************/

 const int N=;

 int root[N],n,m,cnt;

 struct Tree{

     int l,r,cnt;

 }t[N*];

 struct node{

     int val,num,rank;

     bool operator < (const node&now)const{

         return val<now.val;

     }

 }a[N];

 int b[N];

 bool cmp(node a,node b){

     return a.num<b.num;

 }

 #define mid (l+r>>1)

 void update(int &o,int l,int r,int pos){

     t[++cnt]=t[o]; o=cnt; ++t[o].cnt;

     if(l==r)return;

     if(pos<=mid) update(t[o].l,l,mid,pos);

     else update(t[o].r,mid+,r,pos);

 }

 int _sum,ql,qr;

 void query(int i,int j,int l,int r){

     if (ql<=l && qr>=r)    _sum+=t[j].cnt-t[i].cnt;

     else{

         if (ql<=mid) query(t[i].l,t[j].l,l,mid);

         if (qr> mid) query(t[i].r,t[j].r,mid+,r);

     }

 }

 #undef mid

 int main(){

     n=getint(); m=getint();

     F(i,,n) {a[i].val=getint(); a[i].num=i;}

     sort(a+,a+n+);

     int rank=,tot=;

     F(i,,n) if(a[i].val!=a[i-].val){

         a[i].rank=++rank;

         b[++tot]=a[i].val;

     }

     else a[i].rank=rank;

     sort(a+,a+n+,cmp);

     F(i,,n){

         root[i]=root[i-];

         update(root[i],,n,a[i].rank);

     }

     int l,r,k,w;

     F(i,,m){

         l=getint(); r=getint(); k=getint(); w=getint();

         ql=lower_bound(b+,b+tot+,k)-b;

         qr=upper_bound(b+,b+tot+,w)-b-;//!!!

         _sum=;

         query(root[l-],root[r],,n);

         printf("%d\n",_sum);

     }

     return ;

 }