#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
	int ans=0;bool op=0;char ch=getchar();
	while(ch<'0'||'9'<ch){if(ch=='-')op=1;ch=getchar();}
	while('0'<=ch&&ch<='9'){ans=(ans<<1)+(ans<<3)+(ch^48);ch=getchar();}
	if(op)return -ans;
	return ans;
}
const int maxn=1e5+10;
mt19937 rnd(time(0));
int n,q;
int a[maxn];
int val[maxn];
int maxa=0;
map<int,int> mp;
struct node{
	int l,r,val;
}tr[maxn*20];
int rt[maxn],cnt;
void newnode(int &p){
	tr[++cnt]=tr[p];
	p=cnt;
}
void pushup(int p){
	tr[p].val=tr[tr[p].l].val+tr[tr[p].r].val;
}
void update(int pos,int s,int t,int &p){
	newnode(p);
	if(s==t){
		tr[p].val+=val[pos];
		return;
	}
	int mid=(s+t)>>1;
	if(pos<=mid)update(pos,s,mid,tr[p].l);
	else update(pos,mid+1,t,tr[p].r);
	pushup(p);
}
int findl(int a,int b,int c,int d,int s,int t){
	if(s==t)return tr[b].val-tr[a].val-tr[d].val+tr[c].val;
	int mid=(s+t)>>1;
	if(tr[tr[b].l].val-tr[tr[a].l].val!=tr[tr[d].l].val-tr[tr[c].l].val){
		return findl(tr[a].l,tr[b].l,tr[c].l,tr[d].l,s,mid);
	}
	else return findl(tr[a].r,tr[b].r,tr[c].r,tr[d].r,mid+1,t);
}
int findr(int a,int b,int c,int d,int s,int t){
	if(s==t)return tr[b].val-tr[a].val-tr[d].val+tr[c].val;
	int mid=(s+t)>>1;
	if(tr[tr[b].r].val-tr[tr[a].r].val!=tr[tr[d].r].val-tr[tr[c].r].val){
		return findr(tr[a].r,tr[b].r,tr[c].r,tr[d].r,mid+1,t);
	}
	else return findr(tr[a].l,tr[b].l,tr[c].l,tr[d].l,s,mid);
}
int sum(int a,int b,int c,int d,int l,int r,int s,int t){
	if(l>r)return 0;
	if(l<=s&&t<=r)return tr[b].val-tr[a].val+tr[d].val-tr[c].val;
	int mid=(s+t)>>1;
	int ans=0;
	if(l<=mid)ans+=sum(tr[a].l,tr[b].l,tr[c].l,tr[d].l,l,r,s,mid);
	if(mid<r)ans+=sum(tr[a].r,tr[b].r,tr[c].r,tr[d].r,l,r,mid+1,t);
	return ans;
}
signed main(){
	n=read(),q=read();
	for(int i=1;i<=n;i++)a[i]=read(),maxa=max(maxa,a[i]);
	for(int i=1;i<=maxa;i++)val[i]=rnd();
	for(int i=1;i<=maxa;i++)mp[val[i]]=i;
	for(int i=1;i<=n;i++){
		rt[i]=rt[i-1];
		update(a[i],1,maxa,rt[i]);
	}
	for(int i=1;i<=q;i++){
		int c=read(),d=read(),e=read(),f=read();
		int ps1=findl(rt[c-1],rt[d],rt[e-1],rt[f],1,maxa);
		int ps2=findr(rt[c-1],rt[d],rt[e-1],rt[f],1,maxa);
		ps1=abs(ps1),ps2=abs(ps2);
		if(!ps1&&!ps2)puts("YES");
		else if(!mp.count(ps1)||!mp.count(ps2))puts("NO");
		else{
			int val1=mp[ps1],val2=mp[ps2];
			int tmp=sum(rt[c-1],rt[d],rt[e-1],rt[f],val1+1,val2-1,1,maxa);
			if(tmp)puts("NO");
			else puts("YES");
		}
	}
	return 0;
}