#include <bits/stdc++.h>
using namespace std;
using i64 = int;
i64 ans;
i64 n, m, k, summ;
i64 res[100005][2], pre[100005], fa[100005];
i64 g[100005][4];
vector<i64> v[100005];vector<i64> e[100005];//分别存加入和删除
set<array<i64, 3>> st;
int find(int x){//查询父节点
    while (x != fa[x]) x = fa[x] = fa[fa[x]];
    return x;
}
bool merge(int x, int y){//合并 x 和 y 所在并查集
    x = find(x), y = find(y);
    if (x == y) return false;
    if(x != y){ ans--;}
    fa[y] = x;
    return true;
}
//思路：按照左/上端点进行排序，并查集维护连通块，按排序遍历每条边，合并
void init(){
	st.clear();
	summ = ans = 0;
	g[0][0] = g[0][1] = g[0][2] = g[0][3] = -1;
	for(int i = 0; i <= n + 1; i++){
		pre[i] = res[i][0] = res[i][1] = 0; 
		v[i].clear();
		e[i].clear();
	}
	for(int i = 0; i <= k + 1; i++){
		fa[i] = i;
	}
}
void solve(){
	i64 temp, sub, x, y;
    cin >> n >> m >> k;
    init();
    for (int i = 1; i <= k; i++){
    	cin >> g[i][0] >> g[i][1] >> g[i][2] >> g[i][3];
        if(g[i][0] == g[i][2]){//横边
        	res[g[i][0]][0] += g[i][3] - g[i][1] + 1;
        }
        else{//竖边
        	pre[g[i][0]]++;
        	pre[g[i][2]+1]--;
        }
        v[g[i][0]].push_back(i);
        e[g[i][2] + 1].push_back(i);
    }
    for(int i = 1; i <= n; i++){//统计答案s
    	summ += pre[i];
    	res[i][0] += summ;	
    	res[i][0] += res[i-1][0];
    }
    for(int i = 1; i <= n; i++){
    	for(int j = 0; j < v[i].size(); j++){
    		x = v[i][j];
    		auto it = st.lower_bound({x,0,0});
    		if(it != st.begin()){
    			--it;
    		}
    		while(it != st.end()){
    			if((*it)[0] > g[x][3]){
    				break;
    			}
    			if((*it)[1] >= g[x][1] && (*it)[0] <= g[x][3]){
    				merge((*it)[2], x);
    			}
    			it++;
    		}
    	}
    	for(int j = 0; j < e[i].size(); j++){
    		x = e[i][j];
    		st.erase({g[x][1],g[x][3],x});
    	}
    	for(int j = 0; j < v[i].size(); j++){
    		ans++;
    		x = v[i][j];
    		auto it = st.insert({g[x][1],g[x][3],x}).first;
    		auto it1 = it;
    		if(it1 != st.begin()){
    			--it1;
    			if((*it1)[1] == g[x][1] - 1){
    				merge((*it1)[2], x);
    			}
    		}
    		auto it2 = it;
    		++it2;
    		if(it2 != st.end()){
    			if((*it2)[0] == g[x][3] + 1){
    				merge((*it2)[2], x);
    			}
    		}
    	}
    	res[i][1] = ans;
    }
    for(int i = 1; i <= n; i++){
    	cout << res[i][0] << ' ' << res[i][1] << '\n';
    }
    return;
}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
	long long tt = 1;
	cin >> tt;
	while(tt--){
		solve();
	}
    return 0;
}