#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first	
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

struct DSU
{
	int n;
	VI p;
	VI sz;
	
	void init(int _n)
	{
		n = _n;
		sz.assign(n, 1);
		p.resize(n);
		iota(ALL(p), 0);
	}
	int find(int v)
	{
		if(v == p[v])
			return v;
		return p[v] = find(p[v]);
	}
	bool unite(int u, int v)
	{
		u = find(u);
		v = find(v);
		if(u == v)
			return false;
		
		if(sz[u] > sz[v])
			swap(u, v);
		p[u] = v;
		sz[v] += sz[u];
		return true;
	}
}D;

const int N = 1 << 17;
int r[N][2], c[N][2];


set<PII> xi;
int comp = 0;
void uni(int x, int i)
{
	auto it = xi.lower_bound(MP(x, -1));
	if(it != xi.begin() && prev(it)->F == x - 1)
	{
		if(D.unite(i, prev(it)->S))
			comp--;
	}
	it = xi.upper_bound(MP(x, N));
	if(it != xi.end() && it->F == x + 1)
	{
		if(D.unite(i, it->S))
			comp--;
	}	
} 

set<PII> lines[N];
void uniX(int row, int x, int i)
{
	auto it = lines[row].lower_bound(MP(x, -1));
	if(it == lines[row].end())
		return;
	int j = it->S;
	if(c[j][0] <= x && x <= c[j][1])
	{
		if(D.unite(i, j))
			comp--;
	}
}

VI startVert[N], endVert[N], Hor[N];

void solve()
{
	int n, m, k;
	cin >> n >> m >> k;
	FOR(i, 0, k)
	{
		FOR(t, 0, 2)
			cin >> r[i][t] >> c[i][t];
		if(c[i][0] != c[i][1])
		{
			Hor[r[i][0]].PB(i);
			lines[r[i][0]].insert(MP(c[i][1], i));
		}
		else
		{
			startVert[r[i][0]].PB(i);
			endVert[r[i][1]].PB(i);
		}
	}
	
	
	D.init(k);
	LL sum = 0;
	
	
	FOR(i, 1, n + 1)
	{
		for(int id : startVert[i])
		{
			comp++;
			uniX(i - 1, c[id][0], id);
			
			uni(c[id][0], id);
			xi.insert(MP(c[id][0], id));	
		}
		sum += SZ(xi);
		for(int id : Hor[i - 1])
		{
			uniX(i, c[id][0], id);
			uniX(i, c[id][1], id);			
		}
		
		for(int id : Hor[i])
		{
			comp++;
			uni(c[id][0], id);
			uni(c[id][1], id);
			uniX(i - 1, c[id][0], id);
			uniX(i - 1, c[id][1], id);
			
			sum += c[id][1] - c[id][0] + 1;
			
			xi.insert(MP(c[id][0], id));			
			xi.insert(MP(c[id][1], id));
		}
		
		
		for(int id : Hor[i])
		{
			xi.erase(MP(c[id][0], id));			
			xi.erase(MP(c[id][1], id));
		}
		
		for(int id : endVert[i])
		{
			xi.erase(MP(c[id][0], id));
			uniX(i + 1, c[id][0], id);
		}
		cout << sum << " " << comp << "\n";
	}
	
	xi.clear();
	comp = 0;
	FOR(i, 0, n + 1)
	{
		startVert[i].clear();
		endVert[i].clear();
		Hor[i].clear();
		lines[i].clear();
	}
}


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int t;
	cin >> t;
	while(t--)
		solve();
	
	
	return 0;
}