#include <bits/stdc++.h>
#define MAXN 1100006  
#define For(I,A,B) for(int I = A; I <= B; ++I)
#define foR(I,A,B) for(int I = A; I >= B; --I)
using namespace std;
typedef long long _ll;
typedef pair<int,int> pii;

int tot,pre[MAXN];
int find(int x) { return pre[x] == x ? x : pre[x] = find(pre[x]); }
void merge(int x,int y) 
{ 
    x = find(x); y = find(y);
    if(x == y) return;
    pre[x] = y; --tot;
}

vector<int> add[MAXN],del[MAXN];
_ll T,n,m,k,ans,res,r1[MAXN],r2[MAXN],c1[MAXN],c2[MAXN];
void solve()
{
    cin >> n >> m >> k; res = ans = tot = 0; map<pii,int> mp;
    For(i,1,n+1) add[i].clear(), del[i].clear();
    For(i,1,k)
    {
        pre[i] = i;
        cin >> r1[i] >> c1[i] >> r2[i] >> c2[i];
        add[r1[i]].push_back(i); del[r2[i]+1].push_back(i);
    }
    For(i,1,n)
    {
        for(auto id : add[i])
        {
            auto it = mp.lower_bound(pii(c1[id],0));
            if(it != mp.begin()) --it;
            while(it != mp.end() && it->first.first <= c2[id])
            {
                if(it->first.second >= c1[id]) merge(it->second,id);
                ++it;
            }
        }
        for(auto id : del[i])
            res -= c2[id] - c1[id] + 1, mp.erase(pii(c1[id],c2[id]));
        for(auto id : add[i])
        {
            res += c2[id] - c1[id] + 1;
            mp[pii(c1[id],c2[id])] = id;
            auto it = mp.find(pii(c1[id],c2[id]));
            if(it != mp.begin())
            {
                --it;
                if(it->first.second >= c1[id]-1) merge(it->second,id);
                ++it;
            }
            if(it != mp.end())
            {
                ++it;
                if(it != mp.end() && it->first.first <= c2[id]+1) 
                    merge(it->second,id);
            }
        }
        cout << (ans += res) << ' ' << (tot += add[i].size()) << '\n';
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> T;
    while(T--) solve();
    return 0;
}