#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N=1e5+10;

int n,m,ans,cnt;
int R1[N],C1[N],R2[N],C2[N],fa[N];
vector<int> add[N],del[N];

int find(int x){
    return fa[x]==x?x:fa[x]=find(fa[x]);
}

void merge(int x,int y){
    x=find(x),y=find(y);
    if(x==y)return;
    fa[y]=x;
    cnt--;
}

void solve(){
    scanf("%d%*d%d",&n,&m);
    for(int i=1;i<=n+1;i++)add[i].clear(),del[i].clear();
    for(int i=1;i<=m;i++){
        scanf("%d%d%d%d",&R1[i],&C1[i],&R2[i],&C2[i]);
        add[R1[i]].emplace_back(i),del[R2[i]+1].emplace_back(i);
    }
    for(int i=1;i<=m;i++)fa[i]=i;
    ans=cnt=0;
    int tot=0;
    map<pair<int,int>,int> mp;
    for(int i=1;i<=n;i++){
        for(auto x:add[i]){
            auto it=mp.lower_bound(make_pair(C1[x],0));
            if(it!=mp.begin())it=prev(it);
            while(it!=mp.end()&&it->fi.fi<=C2[x]){
                if(it->fi.se>=C1[x])merge(it->se,x);
                it++;
            }
        }
        for(auto x:del[i])tot-=C2[x]-C1[x]+1,mp.erase(make_pair(C1[x],C2[x]));
        for(auto x:add[i]){
            tot+=C2[x]-C1[x]+1;
            mp[make_pair(C1[x],C2[x])]=x;
            auto it=mp.find(make_pair(C1[x],C2[x]));
            if(it!=mp.begin()&&prev(it)->fi.se==C1[x]-1)merge(prev(it)->se,x);
            if(next(it)!=mp.end()&&next(it)->fi.fi==C2[x]+1)merge(next(it)->se,x);
        }
        ans+=tot,cnt+=add[i].size();
        printf("%d %d\n",ans,cnt);
    }
}

int main(){
    int T;scanf("%d",&T);
    while(T--)solve();
    return 0;
}