ll@n,b[n]{},c[n+1]{},d[n+1]{};
rep(n){
	ll@a--;
	b[a]+=1;
}
rep(i,n){
	c[i+1]=c[i]+(b[i]>=1);
	d[i+1]=d[i]+(b[i]>=2);
}
ll@q;
rep(q){
	ll@(l1--,r1,l2--,r2),f;
	if(r1<=l2||r2<=l1){
		f=c[r1]-c[l1]<r1-l1||c[r2]-c[l2]<r2-l2;
	}else{
		sortE(l1,l2);
		sortE(r2,r1);
		f=c[r1]-c[l1]<r1-l1||d[r2]-d[l2]<r2-l2;
	}
	wt(f?"No":"Yes");
}