#include<bits/stdc++.h>
using namespace std;

const int MAXN = 100'005;
int ds[MAXN], comp;
void reset() {
	comp = 0;
}
void create(int x) {
	ds[x] = x;
	comp++;
}
int f(int x) {
	if (ds[x] != x)return ds[x] = f(ds[x]);
	return x;
}
void add(int x, int y) {
	int a = f(x), b = f(y);
	if (a == b)return;
	ds[a] = b;
	comp--;
}

void solve(int t) {
	int n, m, k;
	cin >> n >> m >> k;
	reset();
	long long sum = 0, curropen = 0;
	vector<set<array<int, 3>>> opz(n + 2);
	set<array<int, 3>> ds;

	for (int i = 1; i <= k; i++) {
		int r1, c1, r2, c2;
		cin >> r1 >> c1 >> r2 >> c2;

		opz[r1].insert({c1, c2 + 1, i});
		opz[r2 + 1].insert({c1, c2 + 1, -i});
	}

	for (int i = 1; i <= n; i++) {
		int prevr = -1, previd = -1;
		for (auto [l, r, id] : opz[i]) {
			if (id > 0) {
                auto it = ds.lower_bound({l,0,0});
                create(id);
                if(prevr==l)add(previd,id);
                
                if(it != ds.begin()){
                    it--;
                    auto pre = *it;
                    
                    if(pre[1]>l || (pre[1]==l && opz[i].find({pre[0],pre[1],-pre[2]})==opz[i].end())){
                        add(id,pre[2]);
                    }
                    it++;
                }
                
                while(it != ds.end() && (*it)[0]<r){
                    add(id,(*it)[2]);
                    it++;
                }
                
                if(it!=ds.end() && (*it)[0]==r && opz[i].find({(*it)[0],(*it)[1],-(*it)[2]})==opz[i].end()){
                    add(id,(*it)[2]);
                }
                
                prevr = r;
                previd = id;
			}
		}

		for (auto [l, r, id] : opz[i]) {
			if (id > 0) {
				curropen += (r - l);
				ds.insert({l, r, id});
			} else {
				curropen -= (r - l);
				ds.erase({l, r, -id});
			}
		}
		sum += curropen;
		cout << sum << " " << comp << "\n";
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t = 1;
	cin >> t;
	for (int i = 1; i <= t; i++)solve(i);

	return 0;
}