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

#define int long long

const int N=111;

int T,n,m;

int x[N],y[N],k[N],t[N];

int calc(int L,int R,int u)
{
    int ret=R/60+(R%60>=u);
    if(L>=1)
        ret-=((L-1)/60+((L-1)%60>=u));
    return ret;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>T;
    while(T--)
    {
        cin>>n>>m;
        vector<int> X,Y;
        X.push_back(0);
        X.push_back(m+1);
        Y.push_back(0);
        Y.push_back(m+1);
        for(int i=1;i<=n;i++)
            cin>>x[i]>>y[i]>>k[i]>>t[i],X.push_back(x[i]),Y.push_back(y[i]);
        sort(X.begin(),X.end());
        sort(Y.begin(),Y.end());
        X.erase(unique(X.begin(),X.end()),X.end());
        Y.erase(unique(Y.begin(),Y.end()),Y.end());
        int ans=0;
        for(int i=0;i+1<X.size();i++)
            for(int j=0;j+1<Y.size();j++)
            {
                int lx=X[i],rx=X[i+1]-1;
                int ly=Y[j],ry=Y[j+1]-1;
                for(int u=0;u<60;u++)
                    for(int v=0;v<60;v++)
                    {
                        bool ok=1;
                        for(int i=1;i<=n;i++)
                            if((abs(u-x[i])+abs(v-y[i]))%k[i]!=t[i])
                            {
                                ok=0;
                                break;
                            }
                        if(!ok)
                            continue;
                        ans+=calc(lx,rx,u)*calc(ly,ry,v);
                    }
            }
        cout<<ans<<"\n";
    }
}