#include<bits/stdc++.h>

using namespace std;

typedef long long ll;


const int N = 8e5 + 10;

ll read(){
    ll x = 0, t = 1;

    char c = getchar();

    while(!isdigit(c)){
        if(c == '-') t = -1;
        c = getchar();
    }

    while(isdigit(c)){
        x = (x << 3) + (x << 1) + (c ^ 48);
        c = getchar();
    }

    return x * t;
}

void print(ll x){
    if(x < 0){
        putchar('-');
        print(-x);
    }
    else if(x < 10){
        putchar(x ^ 48);
    }
    else{
        print(x / 10);
        putchar(x % 10 ^ 48);
    }
}

ll C, T;
ll n, m;

ll low[N], up[N];
ll prela[N], prera[N], prelb[N], prerb[N];

struct node{
    ll l1, r1, l2, r2;
} a[N], b[N];

bool cmp1(node &a, node & b){
    return a.r2 < b.r2;
}

bool cmp2(node &a, node &b){
    return a.l2 < b.l2;
}

int bsearch1(ll k){
    int l = 0, r = n;

    while(l < r){
        int mid = (l + r >> 1) + 1;
        if(a[mid].r2 < k) l = mid;
        else r = mid - 1;
    }
    return l;
}

int bsearch2(ll k){
    int l = 1, r = n + 1;

    while(l < r){
        int mid = l + r >> 1;
        if(b[mid].l2 <= k ) l = mid + 1;
        else r = mid;
    }

    return l;
}

ll num[N], idx;

int main(){
    freopen("lucky.in", "r", stdin);
    freopen("lucky.out", "w", stdout);

    C = read();

    T = read();

    while(T--){

        n = read();

        map<ll, bool> mp;
        idx = 0;

        ll suml = 0, sumr = 0;

        for(int i = 1; i <= n; i++)
        {
            ll A = read();
            ll B = read();
            ll c = read();
            ll d = read();
            a[i] = {A, B, c, d};
            b[i] = a[i];
            suml += A;
            sumr += B;
            if(!mp.count(c)){
                num[++idx] = c;
                num[++idx] = c;
                mp[c] = 1;
            }
            if(!mp.count(d)){
                num[++idx] = d;
                num[++idx] = d;
                mp[d] = 1;
            }

        }

        sort(num + 1, num + idx + 1);

        sort(a + 1, a + n + 1, cmp1);
        sort(b + 1, b + n + 1, cmp2);

        for(int i = 1; i <= n; i++){
            prela[i] = prela[i - 1] + a[i].l1;
            prelb[i] = prelb[i - 1] + b[i].l1;
            prera[i] = prera[i - 1] + a[i].r1;
            prerb[i] = prerb[i - 1] + b[i].r1;
        }

        ll ans = 0;

        for(int k = 1; k < idx; k++){
            ll l = num[k], r = num[k + 1];

            if(l != r){
                l++;
                r--;
            }
            if(l > r) continue;

            ll cntll = 0, cntrl = 0;
            ll cntlin = 0, cntrin = 0;
            ll cntlr = 0, cntrr = 0;

            int posa = bsearch1(l);
            if(posa != 0){
                cntll = prela[posa];
                cntrl = prera[posa];
            }

            int posb = bsearch2(r);
            if(posb != n + 1){
                cntlr = prelb[n] - prelb[posb - 1];
                cntrr = prerb[n] - prerb[posb - 1];
            }

            cntlin = suml - cntll - cntlr;
            cntrin = sumr - cntrl - cntrr;

            // for(int i = 1; i <= n; i++){
            //     if(a[i].l2 <= l && a[i].r2 >= r){
            //         cntlin += a[i].l1;
            //         cntrin += a[i].r1;
            //     }
            // }

            // if(!cntlin) continue;

            // //sort(a + 1, a + n + 1, cmp1);
            // for(int i = 1; i <= n; i++){
            //     if(a[i].r2 >= l) continue;
            //     cntll += a[i].l1;
            //     cntrl += a[i].r1;
            // }

            // //sort(a + 1, a + n + 1, cmp2);
            // for(int i = n; i; i--){
            //     if(a[i].l2 <= r) continue;
            //     cntlr += a[i].l1;
            //     cntrr += a[i].r1;
            // }
            if(!cntlin) continue;
            //cout << endl;
            //cout << "pos: " << posa << endl << "pos: " << posb << endl;
            //cout << l << ' ' << r << '\n' << cntll << ' ' << cntlin << ' ' << cntlr << '\n' << cntrl << ' ' << cntrin << ' ' << cntrr << '\n';
            if(cntrl + cntrin >= cntlr && cntrr + cntrin > cntll) ans += r - l + 1;
        }
        print(ans);
        putchar('\n');
    }

    return 0;
}