#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 55;
int c, T;
int n, ans;
struct node {
	int la, ra, lb, rb; 
} a[N], al[N], ar[N];
int slmn[N], srmn[N], slmx[N], srmx[N];
vector<int> e;
bool cmpl(node x, node y) {
	return x.lb < y.lb;
}
bool cmpr(node x, node y) {
	return x.rb < y.rb;
}
int findr(int x) {
	ar[0].rb = 0;
	int l = 0, r = n;
	while (l < r) {
		int mid = (l + r + 1) >> 1;
		if (ar[mid].rb < x) l = mid;
		else r = mid - 1;
	}
	return l;
}
int findl(int x) {
	al[n + 1].lb = 1e9 + 1;
	int l = 1, r = n + 1;
	while (l < r) {
		int mid = (l + r) >> 1;
		if (al[mid].lb > x) r = mid;
		else l = mid + 1;
	}
	return l;
}
int check(int x) {
	int tl = findr(x);
	int tr = findl(x);
	int lmx = srmx[tl] - (slmn[n] - slmn[tr - 1]);
	int rmx = (slmx[n] - slmx[tr - 1]) - srmn[tl];
	int mmx = slmx[n] - (slmx[n] - slmx[tr - 1]) - srmx[tl];
	//printf("x: %lld | tl: %lld tr: %lld| lmx: %lld rmx: %lld mmx: %lld\n", x, tl, tr, lmx, rmx, mmx);
	if (mmx == 0) return 0; 
	if (lmx >= 0 and rmx >= 0) return 1;
	if (lmx > 0) {
		if (rmx + mmx >= 1) return 1;
	}
	else {
		if (lmx + mmx >= 0) return 1;
	}
	return 0;
}
signed main() {
	freopen("lucky.in", "r", stdin);
	freopen("lucky.out", "w", stdout); 
	scanf("%lld%lld", &c, &T);
	while (T--) {
		
		e.clear();
		ans = 0;
		scanf("%lld", &n);
		for (int i = 1; i <= n; i++) {
			scanf("%lld%lld%lld%lld", &a[i].la, &a[i].ra, &a[i].lb, &a[i].rb);
		}
		for (int i = 1; i <= n; i++) {
			e.push_back(a[i].lb);
			e.push_back(a[i].rb);
			al[i] = a[i];
			ar[i] = a[i];			
		}
		sort(e.begin(), e.end());
		sort(al + 1, al + 1 + n, cmpl);
		sort(ar + 1, ar + 1 + n, cmpr);
		slmn[0] = srmn[0] = slmx[0] = srmx[0] = 0;
		for (int i = 1; i <= n; i++) {
			slmn[i] = slmn[i - 1] + al[i].la;
			srmn[i] = srmn[i - 1] + ar[i].la;
			slmx[i] = slmx[i - 1] + al[i].ra;
			srmx[i] = srmx[i - 1] + ar[i].ra;
		}
		for (int i = 0; i < e.size(); i++) {
			if (i == 0 or e[i] != e[i - 1]) ans += check(e[i]);
			if (i != e.size() - 1 and e[i] + 1 < e[i + 1]) ans += (e[i + 1] - e[i] - 1) * check(e[i] + 1);			
		}
		printf("%lld\n", ans);
	}
	return 0;
}