#include<bits/stdc++.h>
using namespace std;
int T,n,q,A[100005];
vector<int>pos[100005];

int cnt(int v,int l,int r){return upper_bound(pos[v].begin(),pos[v].end(),r)-lower_bound(pos[v].begin(),pos[v].end(),l);}

int main(){
    freopen("sequence.in","r",stdin);
    freopen("sequence.out","w",stdout);
	scanf("%d",&T);
	while(T--){
		scanf("%d%d",&n,&q);
		for(int i=1;i<=100000;i++)pos[i].clear();
		for(int i=1;i<=n;i++){
			scanf("%d",&A[i]);
			pos[A[i]].push_back(i);
		}
		while(q--){
			int a,b,c,d;
			scanf("%d%d%d%d",&a,&b,&c,&d);
			int L=b-a+1;
			if(L==1){
				printf(A[a]==A[c]?"YES\n":"NO\n");
				continue;
			}
			int p1=-1,p2=-1,d1=0,d2=0;
			for(int v=1;v<=100000;v++){
				int c1=cnt(v,a,b),c2=cnt(v,c,d);
				if(c1!=c2){
					if(p1==-1){
						p1=v;d1=c1-c2;
					}else if(p2==-1){
						p2=v;d2=c1-c2;
					}else{
						p1=-2;break;
					}
				}
			}
			if(p1==-1)printf("YES");
			else if(p1==-2)printf("NO");
			else if(p2==-1)printf("NO");
			else if(p2-p1==1&&d1==1&&d2==-1)printf("YES");
			else if(p2-p1==1&&d1==-1&&d2==1)printf("YES");
			else printf("NO");
			printf("\n");
		}
	}
	return 0;
}