#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 101010;

int n, m, k;
vector<array<int, 3>> V[4][MAXN];
vector<pair<int, int>> E[MAXN];

void run(vector<array<int, 3>> &H, vector<array<int, 3>> &L, int x) {
	if (H.empty() || L.empty()) {
		return;
	}
	sort(H.begin(), H.end());
	sort(L.begin(), L.end());

	auto f = [&](auto s, auto t) {
		int l = max(s[1], t[1]);
		int r = min(s[0], t[0]);
		if (l <= r) {
			E[(x == -1) ? l : x + 1].push_back({s[2], t[2]});
		}
	};
	
	for (int q = 0, p = 0; q < L.size(); q++) {
		if (p < H.size()) {
			f(H[p], L[q]);
		}
		while (p < H.size() && L[q][0] >= H[p][0]) {
			++p;
			if (p < H.size()) f(H[p], L[q]);
		}
	}
}

struct dsu {
	int par[MAXN];

	void init(int _n) {
		for (int i = 0; i < _n + 5; i++) {
			par[i] = i;
		}
	}
	int find(int a) {
		return par[a] = ((par[a] == a) ? a : find(par[a]));
	}
	bool merge(int a, int b) {
		a = find(a);
		b = find(b);
		if (a != b) {
			par[b] = a;
		}
		return a != b; // true if different component
	}
} d1;

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	int T;
	cin >> T;
	while (T--) {
		cin >> n >> m >> k;

		vector<int> P;

		vector<ll> ans(n + 2), cmp(n + 2);
		for (int i = 0; i < k; i++) {
			int rs, re, cs, ce;
			cin >> rs >> cs >> re >> ce;
			V[0][re].push_back({ce, cs, i});
			V[1][rs].push_back({ce, cs, i});

			V[2][ce].push_back({re, rs, i});
			V[3][cs].push_back({re, rs, i});

			int sz = ce - cs + 1;

			ans[rs] += sz;
			ans[re + 1] -= sz;
			
			cmp[rs] += 1;
			
			P.push_back(cs);
			P.push_back(ce);
		}
		for (int i = 1; i <= n; i++) ans[i] += ans[i - 1];
		for (int i = 1; i <= n; i++) ans[i] += ans[i - 1];

		sort(P.begin(), P.end());
		P.erase(unique(P.begin(), P.end()), P.end());

		for (int x = 1; x < n; x++) {
			run(V[0][x], V[1][x + 1], x);
		}
		for (int i = 0; i < (int)P.size() - 1; i++) {
			if (P[i] + 1 != P[i + 1]) continue;
			run(V[2][P[i]], V[3][P[i] + 1], -1);
		}
		
		d1.init(k);
		for (int i = 1; i <= n; i++) {
			cmp[i] += cmp[i - 1];
			for (auto [u, v] : E[i]) {
				cmp[i] -= d1.merge(u, v);
			}
		}
		
		for (int i = 1; i <= n; i++) {
			cout << ans[i] << ' ' << cmp[i] << '\n';
		}

		// init
		for (int i = 1; i <= n; i++) {
			for (int t = 0; t < 2; t++) {
				V[t][i].clear();
			}
			E[i].clear();
		}
		for (int y : P) {
			for (int t = 2; t < 4; t++) {
				V[t][y].clear();
			}
		}
	}
}