#include <bits/stdc++.h>
using namespace std;
#define C const
#define U unsigned
#define SC static
#define CE constexpr
#define TL template
#define TN typename
#define OP operator
#define pb push_back
#define ft first
#define sd second
#define mi (l + (r - l) / 2)
#define TTT TL<TN T = I>
#define TTI TL<TN It>
#define BE(v) v.begin(), v.end()
#define VD void
#define BL bool
#define CH char
#define I int
#define LL long long
#define II __int128
#define D double
using PII = pair<I, I>;
TTT using V = vector<T>;

#define FORX(v) for(auto& x : v)
#define FOR(i, b, e)  for(auto i = b, _e = (decltype(i))e;i != _e; ++i)
#define FORR(i, b, e) for(auto i = b, _e = (decltype(i))e;i != _e; --i)
#define FORV(v, i) for (I i = 0, _n = v.size(), x = _n ? v[0] : 0;i < _n;x = v[++i])
#define FUNC(T, f, ...) function<T(__VA_ARGS__)> f = [&](__VA_ARGS__)->T

#define DR(T, ...) T __VA_ARGS__; R(__VA_ARGS__);
TTT VD R(T& x) { cin >> x; }
TTT T R() { DR(T, x); return x; }
TL<TN T, TN... A> VD R(T& x, A&... a) { R(x), R(a...); }
CE CH LF = '\n', SP = ' ';
TL<CH s = LF> VD W() { cout << s; }
TL<CH s = LF, TN T> VD W(C T& x) { cout << x << s; }
TL<CH s = LF, TN T, TN... A> VD W(C T& x, C A&... a) { W<SP>(x), W<s>(a...); }

TTT CE T inf() { return numeric_limits<T>::max() / 2; }
TTT VD setmin(T& a, C T& b) { if (b < a)a = b; }
TTT VD setmax(T& a, C T& b) { if (a < b)a = b; }

struct DSU
{
	V<I> f;
	DSU(I n) :f(n) { FOR(i, 0, n)f[i] = i; }
	I fa(I p) { return p == f[p] ? p : (f[p] = fa(f[p])); }
	BL merge(I x, I y) { f[y = fa(y)] = x = fa(x);return x != y; }
};
struct P
{
	I l, r, id;
	friend BL OP < (C P& a, C P& b) { return a.r < b.l; }
};
VD test()
{
	DR(I, n, m, k); ++n;
	using PP = pair<I, PII>;
	V<V<PII>> v(n + 1); V<set<P>> h(n);
	map<I, I> vm; LL tot = 0, cnt = 0;
	FOR(i, 0, k)
	{
		DR(I, r1, c1, r2, c2);
		if (r1 == r2)h[r1].insert({ c1,c2,i });
		else v[r1].pb({ c1,i }), v[r2 + 1].pb({ c2,i });
	}
	DSU ds(k);
	FOR(i, 1, n)
	{
		sort(BE(v[i]));
		FORX(v[i])
		{
			if (!vm.count(x.ft))vm[x.ft] = x.sd, ++cnt;
			else if (vm[x.ft] == x.sd)vm.erase(x.ft);
			else ds.merge(vm[x.ft], x.sd), vm[x.ft] = x.sd;
		}
		tot += vm.size();
		FOR(it, h[i].begin(), h[i].end())
		{
			auto& x = *it; tot += x.r - x.l + 1; ++cnt;
			auto er = h[i - 1].equal_range(x);
			for (auto it = er.ft; it != er.sd;++it)cnt -= ds.merge(it->id, x.id);
			if (vm.count(x.l - 1))cnt -= ds.merge(vm[x.l - 1], x.id);
			if (vm.count(x.r + 1))cnt -= ds.merge(vm[x.r + 1], x.id);
			auto ir = it; if (++ir != _e && it->r + 1 == ir->l)cnt -= ds.merge(it->id, ir->id);
		}
		W(tot, cnt);
	}
}

I main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	if (fopen("test.in", "r"))
	{
		freopen("test.in", "r", stdin);
		freopen("test.out", "w", stdout);
	}
	I t = 1;
	R(t);
	while (t--)test();
	return 0;
}