#include<cstdio>#include<algorithm>#include<cmath>using namespace std;int Num,CH[12],f,c;inline void R(int &x){    c=0;f=1;    for(;c<‘0‘||c>‘9‘;c=getchar())if(c==‘-‘)f=-1;    for(x=0;c>=‘0‘&&c<=‘9‘;c=getchar())(x*=10)+=(c-‘0‘);    x*=f;}void P(int x){    if(x<10)putchar(x+‘0‘);    else{P(x/10);putchar(x%10+‘0‘);}}#define N 100001#define M 1000001#define BN 330int sum=1,l[BN],num2[N],num[N],r[BN],a[N],b[N],cnts[BN];int anss[M],n,m;struct Ask{int l,r,a,b,p;void Read(const int &I){R(l);R(r);R(a);R(b);p=I;}}Q[M];bool operator < (const Ask &a,const Ask &b){return num[a.l]!=num[b.l] ? num[a.l]<num[b.l] : a.r<b.r;}void makeblock(){    int sz=sqrt(n); if(!sz) sz=1;    for(;sum*sz<n;++sum)      {        l[sum]=r[sum-1]+1; r[sum]=sum*sz;        for(int i=l[sum];i<=r[sum];++i) num[i]=sum;      }    l[sum]=r[sum-1]+1;    for(int i=l[sum];i<=n;++i) num[i]=sum;}inline void Query(const int &L,const int &R,const int &P){	int res=0;	if(num[L]==num[R]) for(int i=L;i<=R;++i) res+=(b[i]?1:0);	else	  {	  	for(int i=L;i<=r[num[L]];++i) res+=(b[i]?1:0);	    for(int i=l[num[R]];i<=R;++i) res+=(b[i]?1:0);	    for(int i=num[L]+1;i<num[R];++i) res+=cnts[i];	  }	anss[P]=res;}inline void Insert(const int &x){if(!b[x]) ++cnts[num[x]]; ++b[x];}inline void Delete(const int &x){--b[x]; if(!b[x]) --cnts[num[x]];}int main(){	R(n);R(m);	for(int i=1;i<=n;++i) R(a[i]);	for(int i=1;i<=m;++i) Q[i].Read(i);	makeblock(); sort(Q+1,Q+m+1);    for(int i=Q[1].l;i<=Q[1].r;++i) Insert(a[i]);    Query(Q[1].a,Q[1].b,Q[1].p);    for(int i=2;i<=m;++i)      {        if(Q[i].l<Q[i-1].l) for(int j=Q[i-1].l-1;j>=Q[i].l;--j) Insert(a[j]);        else for(int j=Q[i-1].l;j<Q[i].l;++j) Delete(a[j]);        if(Q[i].r<Q[i-1].r) for(int j=Q[i-1].r;j>Q[i].r;--j) Delete(a[j]);        else for(int j=Q[i-1].r+1;j<=Q[i].r;++j) Insert(a[j]);        Query(Q[i].a,Q[i].b,Q[i].p);      }    for(int i=1;i<=m;++i) P(anss[i]),puts("");	return 0;}