#include<bits/stdc++.h>
using namespace std;
int c, T, n;
int a[200005][4];
int main() {
    freopen("lucky.in", "r", stdin);
    freopen("lucky.out", "w", stdout);
    scanf("%d%d", &c, &T);
    while (T--) {
        scanf("%d", &n);
        int maxz = 0, minz = 0;
        for (int i = 1; i <= n; i++) {
            scanf("%d%d%d%d", &a[i][0], &a[i][1], &a[i][2], &a[i][3]);
            minz = min(minz,a[i][2]);
            maxz = max(maxz,a[i][3]);
        }
        int ans=0;
        for (int z = minz; z <= maxz; z++) {
            int m=0, l[2]={0,0}, r[2]={0,0};
            for (int i = 1; i <= n; i++) {
                if (z>=a[i][2] && z<=a[i][3]) {
                    m += a[i][1];
                }
                else if (z < a[i][2]) {
                    r[0] += a[i][0];
                    r[1] += a[i][1];
                }
                else if (z > a[i][3]) {
                    l[0] += a[i][0];
                    l[1] += a[i][1];
                }
            }
            if (m == 0) {
                continue;
            }
            else if (r[0] > l[1]) {
                if (l[1] + m < r[0]) {
                    continue;
                }
                else {
                    ans++;
                }
            }
            else if (l[0] > r[1]) {
                if (r[1] + m <= l[0]) {
                    continue;
                }
                else {
                    ans++;
                }
            }
            else {
                ans++;
                continue;
            }
        }
        cout << ans << endl;
    }
    return 0;
}