#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

const int MAXN=405;
struct node {
	int la,ra,lb,rb;
} tsk[MAXN];
int n;
int s[MAXN<<2],b[MAXN<<2],tail;
bool vis[MAXN];
int ans;

void dfs(int x) {
	if(x>n) {
		for(int i=1;i<=tail;i++) b[i]=s[i];
		sort(b+1,b+tail+1);
		if(!vis[b[(tail+1)/2]]) {
			vis[b[(tail+1)/2]]=true;
			ans++;
		}
		return;
	}
	auto [la,ra,lb,rb] = tsk[x];
	for(int i=lb;i<=rb;i++) {
		for(int j=1;j<la;j++) s[++tail]=i;
		for(int j=la;j<=ra;j++) {
			s[++tail]=i;
		// cout<<x<<": ";
		// for(int j=1;j<=tail;j++) cout<<s[j]<<" ";
		// cout<<endl;
			dfs(x+1);
		}
		tail-=ra;
	}
}

void solve() {
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>tsk[i].la>>tsk[i].ra>>tsk[i].lb>>tsk[i].rb;
	tail=0;
	memset(vis,0,sizeof(vis));
	ans=0;
	dfs(1);
	cout<<ans<<endl;
}

signed main() {
	freopen("lucky.in","r",stdin);
	freopen("lucky.out","w",stdout);

	int c,t;
	cin>>c>>t;
	while(t--) solve();

	return 0;
}