#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll mod=60;
ll gao(ll L,ll R,ll a){
	L-=a;
	R-=a;
	ll restR=R%mod;
	if (restR<0) restR+=mod;
	ll restL=L%mod;
	if (restL>0) restL-=mod;
	L-=restL;
	R-=restR;
	return (R-L)/mod+1;
}

ll n,m;
ll x[20],y[20],k[20],t[20];
void solve(){
	cin >> n >> m;
	for (int i=1;i<=n;i++) cin >> x[i] >> y[i] >> k[i] >> t[i];	
	
	vector<ll> vx,vy;
	for (int i=1;i<=n;i++){
		vx.push_back(x[i]);
		vy.push_back(y[i]);	
	}
	vx.push_back(0);vx.push_back(m+1);
	vy.push_back(0);vy.push_back(m+1);
	sort(vx.begin(),vx.end());
	sort(vy.begin(),vy.end());
	
	int szx=vx.size();
	int szy=vy.size();
	ll ans=0;
	for (int selx=1;selx<szx;selx++){
		ll lx=vx[selx-1];
		ll rx=vx[selx]-1;
		if (lx>rx) continue;
		for (int sely=1;sely<szy;sely++){
			ll ly=vy[sely-1];
			ll ry=vy[sely]-1;
			if (ly>ry) continue;
			
			for (ll a=0;a<mod;a++){
				for (ll b=0;b<mod;b++){
					bool flag=1;
					for (int i=1;i<=n;i++){
						ll tmp=0;
						if (lx>=x[i]) tmp+=x[i]-a;
						else tmp+=a-x[i];
						
						if (ly>=y[i]) tmp+=y[i]-b;
						else tmp+=b-y[i];
							
						tmp=tmp%k[i];
						if (tmp<0) tmp+=k[i];
						if (tmp!=t[i]){
							flag=0;
							break;	
						}
					}
					if (!flag) continue;
					ans+=gao(lx,rx,a)*gao(ly,ry,b);
				}
			}
		}
	}
	cout << ans << "\n";
}

int main(){
	ios_base::sync_with_stdio(false);
	int Tcase=10;
	cin >> Tcase;
	for (;Tcase--;){
		solve();
	}
	return 0;	
}