#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int act[N];

void solve() {
	int n, m, k; cin >> n >> m >> k;
	vector<vector<array<int, 4>>> arr(n + 1);
	vector<array<int, 4>> lin(k);
	for (int i = 0; i < k; i++) {
		int r1, c1, r2, c2; cin >> r1 >> c1 >> r2 >> c2;
		arr[r1].push_back({c1, r2, c2, i});
		lin[i] = {r1, c1, r2, c2};
	}
	ll cnt = 0;
	vector<int> pref(n + 2), par(k + 1);
	iota(all(par), 0);
	function<int(int)> qry = [&](int x) {
		return x == par[x] ? x : par[x] = qry(par[x]);
	};
	auto join = [&](int x, int y) {
		if (qry(x) == qry(y))
			return 0;
		par[qry(x)] = qry(y);
		return 1;
	};
	int comp = 0;
	vector<vector<int>> todo(n + 1);
	for (int r1 = 1; r1 <= n; r1++) {
		sort(arr[r1].begin(), arr[r1].end());
		int lst = -1;
		for (auto [c1, r2, c2, i]: arr[r1]) {
			if (lst != -1 && lin[lst][3] + 1 == c1)
				comp -= join(lst, i);
			if (act[c1 - 1] != -1)
				comp -= join(i, act[c1 - 1]);
			if (act[c2 + 1] != -1)
				comp -= join(i, act[c2 + 1]);
			comp++;
			lst = i;
			if (c1 == c2) {
				act[c1] = i;
				todo[r2].push_back(i);
			}
			pref[r1] += c2 - c1 + 1;
			pref[r2 + 1] -= c2 - c1 + 1;
		}
		for (int i: todo[r1])
			act[lin[i][1]] = -1;
		for (int i: todo[r1 - 1]) {
			int c = lin[i][1];
			array<int, 4> tmp = {c + 1, -1, -1, -1};
			auto it = lower_bound(all(arr[r1]), tmp);
			if (it != arr[r1].begin() && c <= (*prev(it))[2])
				comp -= join(i, (*prev(it))[3]);
		}
		for (int f: {0, 1}) {
			for (auto [c1, r2, c2, i]: arr[r1 - f]) {
				for (int x: {c1, c2}) {
					array<int, 4> tmp = {x + 1, -1, -1, -1};
					auto it = lower_bound(all(arr[r1 - !f]), tmp);
					if (it != arr[r1 - !f].begin() && (*prev(it))[2] >= x)
						comp -= join(i, (*prev(it))[3]);
				}
			}
		}
		pref[r1] += pref[r1 - 1];
		cnt += pref[r1];
		cout << cnt << " " << comp << "\n";
	}
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	memset(act, -1, sizeof act);
	int t; cin >> t; while (t--) solve();
}