#include <algorithm>
#include <cstdio>
#include <iostream>

using namespace std;

constexpr int N = 114514;

int t;
int n;
int q;
int nums[N];
int one[N];
int two[N];

int main () {

	freopen ("sequence.in", "r", stdin);
	freopen ("sequence.out", "w", stdout);
	
	scanf ("%d", &t);
	for (int index = 1; index <= t; index++) {
		scanf ("%d %d", &n, &q);
		for (int i = 1; i <= n; i++) {
			scanf ("%d", &nums[i]);
		}

		int a, b, c, d;
		int len;
		for (int i = 1; i <= q; i++) {
			scanf ("%d %d %d %d", &a, &b, &c, &d);
			len = b - a + 1;
			for (int j = 1; j <= len; j++) {
				one[j] = nums[a + j - 1];
				two[j] = nums[c + j - 1];
			}
			sort (one + 1, one + len + 1);
			sort (two + 1, two + len + 1);
			int cc = 0;
			for (int j = 1; j <= len; j++) {
				cc += one[j] != two[j];
			}
			if (cc > 1) {
				printf ("NO\n");
			}
			else {
				printf ("YES\n");
			}
		}
	}

	return 0;
}