#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, m;
    std::cin >> n >> m;
    m += 1;

    std::vector<int> x(n), y(n), k(n), t(n);
    std::vector<int> vx{0, m}, vy{0, m};
    for (int i = 0; i < n; i++) {
        std::cin >> x[i] >> y[i] >> k[i] >> t[i];
        vx.push_back(x[i]);
        vy.push_back(y[i]);
    }
    std::sort(vx.begin(), vx.end());
    std::sort(vy.begin(), vy.end());
    vx.erase(std::unique(vx.begin(), vx.end()), vx.end());
    vy.erase(std::unique(vy.begin(), vy.end()), vy.end());

    i64 ans = 0;
    for (int i = 0; i < vx.size() - 1; i++) {
        for (int j = 0; j < vy.size() - 1; j++) {
            for (int mx = 0; mx < 60; mx++) {
                for (int my = 0; my < 60; my++) {
                    bool ok = true;
                    for (int l = 0; l < n; l++) {
                        int a = 0;
                        if (vx[i] < x[l]) {
                            a += x[l] - mx;
                        } else {
                            a += mx - x[l];
                        }
                        if (vy[j] < y[l]) {
                            a += y[l] - my;
                        } else {
                            a += my - y[l];
                        }
                        a %= k[l];
                        if (a < 0) {
                            a += k[l];
                        }
                        if (a != t[l]) {
                            ok = false;
                        }
                    }
                    if (ok) {
                        i64 nx = (vx[i + 1] - mx + 59) / 60 - (vx[i] - mx + 59) / 60;
                        i64 ny = (vy[j + 1] - my + 59) / 60 - (vy[j] - my + 59) / 60;
                        ans += nx * ny;
                    }
                }
            }
        }
    }

    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}