#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()

const int C = 60;

ll floor(ll a, ll b) {
    return a / b - (a % b && (a < 0) ^ (b < 0));
}
ll ceil(ll a, ll b) {
    return a / b + (a % b && (a < 0) ^ (b > 0));
}

ll num(ll d, ll l, ll r) {
    ll tl = ceil(l - d, 60) * 60 + d;
    ll tr = floor(r - d, 60) * 60 + d;
    if (tl > tr) return 0;
    return (tr - tl) / 60 + 1;
}

struct node {
    int x, y, k, t;
} arr[15];

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> xval({0, m + 1}), yval({0, m + 1});
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i].x >> arr[i].y >> arr[i].k >> arr[i].t;
        xval.pb(arr[i].x);
        yval.pb(arr[i].y);
    }
    sort(ALL(xval)), xval.resize(unique(ALL(xval)) - xval.begin());
    sort(ALL(yval)), yval.resize(unique(ALL(yval)) - yval.begin());

    auto check = [&](int x, int y, int cx, int cy) {
        for (int i = 1; i <= n; ++i) {
            ll val = 0;
            if (cx < arr[i].x) val += arr[i].x - x;
            else val += x - arr[i].x;
            if (cy < arr[i].y) val += arr[i].y - y;
            else val += y - arr[i].y;
            if ((val % arr[i].k + arr[i].k) % arr[i].k != arr[i].t)
                return false;
        }
        return true;
    };

    ll ans = 0;
    for (int x = 0; x < 60; ++x)
        for (int y = 0; y < 60; ++y)
            for (int xi = 0; xi + 1 < SZ(xval); ++xi)
                for (int yi = 0; yi + 1 < SZ(yval); ++yi) {
                    if (check(x, y, xval[xi], yval[yi])) {
                        ans += num(x, xval[xi], xval[xi + 1] - 1) * num(y, yval[yi], yval[yi + 1] - 1); 
                    }
                }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}