#include<bits/stdc++.h>
using namespace std;
int n,m,K;


vector<int> add[100005],del[100005];
pair<pair<int,int>,pair<int,int>> rec[100005];
int fa[100005];
int getfa(int x){return fa[x]==x?x:fa[x]=getfa(fa[x]);}
map<pair<int,int>,int> M;
int cnt1,cnt2;
void solve(){
	scanf("%d %d %d",&n,&m,&K);
	for(int i=1;i<=K;++i){
		scanf("%d %d %d %d",&rec[i].first.first,&rec[i].first.second,&rec[i].second.first,&rec[i].second.second);
		add[rec[i].first.first].push_back(i);
		del[rec[i].second.first+1].push_back(i);
		fa[i]=i;
	}
	for(int i=1,now=0;i<=n;++i){
		for(int it:add[i]){
			auto itt=M.lower_bound({rec[it].first.second,0});
			if(itt!=M.begin())itt=prev(itt);
			while(itt!=M.end() && itt->first.first<=rec[it].second.second){
				if(itt->first.second>=rec[it].first.second){
//					cerr<<it<<' '<<itt->second<<' '<<rec[it].second.second<<' '<<itt->first.first<<'\n';
					if(getfa(it)!=getfa(itt->second)){
						fa[getfa(it)]=getfa(itt->second);
						cnt2--;
					}
				}
				it++;
			}
		}
		for(int it:del[i]){
			now-=rec[it].second.second-rec[it].first.second+1;
			M.erase({rec[it].first.second,rec[it].second.second});
		}
		for(int it:add[i]){
			cnt2++;
			now+=rec[it].second.second-rec[it].first.second+1;
			M[{rec[it].first.second,rec[it].second.second}]=it;
			auto itt=M.find({rec[it].first.second,rec[it].second.second});
			if(itt!=M.begin() && prev(itt)->first.second==rec[it].first.second-1){
				if(getfa(it)!=getfa(prev(itt)->second)){
					fa[getfa(it)]=getfa(prev(itt)->second);
					cnt2--;
					
				}
			}
			if(itt!=prev(M.end()) && next(itt)->first.first==rec[it].second.second+1){
				if(getfa(it)!=getfa(next(itt)->second)){
					fa[getfa(it)]=getfa(next(itt)->second);
					cnt2--;
					
				}
			}
		}
		cnt1+=now;
		printf("%d %d\n",cnt1,cnt2);
	}
	for(int i=1;i<=n+1;++i)add[i].clear(),del[i].clear();
	cnt1=cnt2=0;
	M.clear();
}


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