#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <iostream>#include <algorithm>#include <queue>#include <set>#include <map>#include <sstream>using namespace std;typedef long long ll;#define pb push_back#define rep(i, n) for(int i=0; i<(n); ++i)#define for1(i,a,n) for(int i=(a);i<=(n);++i)#define for2(i,a,n) for(int i=(a);i<(n);++i)#define for3(i,a,n) for(int i=(a);i>=(n);--i)#define for4(i,a,n) for(int i=(a);i>(n);--i)#define CC(i,a) memset(i,a,sizeof(i))#define read(a) a=getint()#define print(a) printf("%d", a)#define dbg(x) cout << (#x) << " = " << (x) << endl#define error(x) (!(x)?puts("error"):0)#define rdm(x, i) for(int i=ihead[x]; i; i=e[i].next)inline int getint() { static int r, k; r=0,k=1; static char c; c=getchar(); for(; c<‘0‘||c>‘9‘; c=getchar()) if(c==‘-‘) k=-1; for(; c>=‘0‘&&c<=‘9‘; c=getchar()) r=r*10+c-‘0‘; return k*r; }const int N=100005;int n, pos[N], cnt[N], sum[N], m, ans[N*10], w[N], sq;struct dat { int l, r, a, b, id; }a[N*10];inline bool cmp(const dat &a, const dat &b) { return pos[a.l]==pos[b.l]?a.r<b.r:a.l<b.l; }void init() { sq=sqrt(n+0.5); for1(i, 1, n) pos[i]=(i-1)/sq+1; }int ask(int l, int r) {	int bl=pos[l], br=pos[r], ret=0;	if(bl==br) { for1(i, l, r) ret+=cnt[i]>0; return ret; }	for1(i, bl+1, br-1) ret+=sum[i];	bl=sq*bl;	br=sq*(br-1)+1;	for1(i, l, bl) ret+=cnt[i]>0;	for1(i, br, r) ret+=cnt[i]>0;	return ret;}void update(int x, int k) {	cnt[x]+=k;	if(k==1 && cnt[x]==1) ++sum[pos[x]];	if(k==-1 && cnt[x]==0) --sum[pos[x]];}int main() {	read(n); read(m);	for1(i, 1, n) read(w[i]);	init();	for1(i, 1, m) read(a[i].l), read(a[i].r), read(a[i].a), read(a[i].b), a[i].id=i;	sort(a+1, a+1+m, cmp);	int l=1, r=0;	for1(i, 1, m) {		int nl=a[i].l, nr=a[i].r;		while(l<nl) update(w[l++], -1);		while(l>nl) update(w[--l], 1);		while(r<nr) update(w[++r], 1);		while(r>nr) update(w[r--], -1);		ans[a[i].id]=ask(a[i].a, a[i].b);	}	for1(i, 1, m) printf("%d\n", ans[i]);	return 0;}