#include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
#define DOR(i,s,t) for(int i=(s),_t=(t); i>=_t; --i)
typedef long long ll;
const int N=1e5+50;
unordered_map<int,set<pair<pair<int,int>,int>>> A,B;
int qry(int x,int y) {
    if(A.count(x)) {
        auto it=A[x].upper_bound({{y,1e9},0});
        if(it!=A[x].begin()) {
            --it;
            if((it->first).second>=y) return it->second;
        }
    }
    if(B.count(y)) {
        auto it=B[y].upper_bound({{x,1e9},0});
        if(it!=B[y].begin()) {
            --it;
            if((it->first).second>=x) return it->second;
        }
    }
    return 0;
}
vector<pair<int,int>> a[N];
vector<int> b[N];

int X1[N],Y1[N],X2[N],Y2[N];
ll sum[N];
int Fa[N];
int Find(int x) {
    return Fa[x]==x?x:Fa[x]=Find(Fa[x]);
}
void solve() {
    int n,m,K;
    // n=m=K=1e5;
    cin >> n >> m >> K;
    A.clear();
    B.clear();
    FOR(i,0,n+1) sum[i]=0;
    FOR(i,0,n+1) a[i].clear();
    FOR(i,0,n+1) b[i].clear();
    FOR(i,1,K) {
        int x1,y1,x2,y2;
        // x1=x2=rand()%n+1,y1=rand()%m+1,y2=rand()%m+1;
        // if(y1>y2) swap(y1,y2);
        cin >> x1 >> y1 >> x2 >> y2;
        b[x1].push_back(i);
        X1[i]=x1,Y1[i]=y1,X2[i]=x2,Y2[i]=y2;
        if(x1==x2) {
            A[x1].insert({{y1,y2},i});
            sum[x1]+=y2-y1+1;
            sum[x1+1]-=y2-y1+1;
        } else {
            B[y1].insert({{x1,x2},i});
            sum[x1]++;
            sum[x2+1]--;
        }
    }
    FOR(i,1,K) {
        int x=X1[i],y=Y1[i];
        for(auto j: {qry(x-1,y),qry(x,y-1),qry(x,y+1)}) {
            if(j) a[x].push_back({i,j});
        }
        for(auto j: {qry(x+1,y)}) {
            if(j) a[x+1].push_back({i,j});
        }
        x=X2[i],y=Y2[i];
        for(auto j: {qry(x-1,y),qry(x,y-1),qry(x,y+1)}) {
            if(j) a[x].push_back({i,j});
        }
        for(auto j: {qry(x+1,y)}) {
            if(j) a[x+1].push_back({i,j});
        }
    }
    FOR(i,1,K) Fa[i]=i;
    ll s=0,ss=0;
    int r=0;
    FOR(i,1,n) {
        r+=b[i].size();
        for(auto [u,v]: a[i]) {
            if(Find(u)!=Find(v)) {
                --r;
                Fa[Find(u)]=Find(v);
            }
        }
        s+=sum[i];
        ss+=s;
        cout << ss << ' ' << r << '\n';
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T=5;
    cin >> T;
    while(T--) solve();
    return 0;
}