#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int r1[100005],c1[100005],r2[100005],c2[100005];
int xl[100005],cnt;
int now[100005];
int fa[200005];
vector<int>cx[100005],xs[100005],hx[200005];
int findf(int n)
{
	if(fa[n]==n)return n;
	return fa[n]=findf(fa[n]);
}
bool bi(int x,int y)
{
	return c1[x]<c1[y];
}
int lt=0;
void merge(int x,int y)
{
	x=findf(x);
	y=findf(y);
	if(x==y)return;
	fa[x]=y;
	lt--;
}
signed main()
{
	int t,n,m,k;
	t=read();
	for(int greg=1;greg<=t;greg++)
	{
		n=read();
		m=read();
		k=read();
		for(int i=1;i<=n+1;i++)
		{
			cx[i].clear();
			xs[i].clear();
			hx[i].clear();
		}
		for(int i=1;i<=k;i++)
		{
			r1[i]=read();
			c1[i]=read();
			r2[i]=read();
			c2[i]=read();
			fa[i]=i;
			if(c1[i]==c2[i])
			{
				cx[r1[i]].push_back(i);
				xs[r2[i]+1].push_back(i);
			}
			else
			{
				hx[r1[i]].push_back(i); 
			}
		}
		for(int i=1;i<=n;i++)sort(hx[i].begin(),hx[i].end(),bi);
		long long zs=0,het=0;
		lt=0;
		for(int i=1;i<=n;i++)
		{
			cnt=0;
			for(int j=0;j<xs[i].size();j++)
			{
				xl[++cnt]=xs[i][j];
			}
			sort(xl+1,xl+cnt+1,bi);
			int gre=1;
			for(int j=0;j<hx[i].size();j++)
			{
				lt++;
				int l=c1[hx[i][j]],r=c2[hx[i][j]];
				while(gre<=cnt&&c1[xl[gre]]<l)gre++;
				while(gre<=cnt&&c1[xl[gre]]<=r)
				{
					merge(hx[i][j],xl[gre]);
					gre++;
				}
				het+=r-l+1;
				if(j+1<hx[i].size()&&c1[hx[i][j+1]]==c2[hx[i][j]]+1)
				{
					merge(hx[i][j],hx[i][j+1]);
				}
			}
			cnt=0;
			for(int j=0;j<cx[i].size();j++)
			{
				if(now[c1[cx[i][j]]]!=0)
				{
					merge(cx[i][j],now[c1[cx[i][j]]]);
				}
			}
			for(int j=0;j<xs[i].size();j++)
			{
				now[c1[xs[i][j]]]=0;
				zs--;
			}
			for(int j=0;j<cx[i].size();j++)
			{
				xl[++cnt]=cx[i][j];
				lt++;
				now[c1[cx[i][j]]]=cx[i][j];
				int tid=cx[i][j],sth=c1[cx[i][j]];
				if(sth-1>=1&&now[sth-1]!=0)
				{
					merge(tid,now[sth-1]);
				}
				if(sth+1<=m&&now[sth+1]!=0)
				{
					merge(tid,now[sth+1]);
				}
				zs++;
			}
			sort(xl+1,xl+cnt+1,bi);
			het+=zs;
			if(i>1)
			{
			gre=1;
			for(int j=0;j<hx[i-1].size();j++)
			{
				int l=c1[hx[i-1][j]],r=c2[hx[i-1][j]];
				while(gre<=cnt&&c1[xl[gre]]<l)gre++;
				while(gre<=cnt&&c1[xl[gre]]<=r)
				{
					merge(hx[i-1][j],xl[gre]);
					gre++;
				}
			}
			}
			for(int j=0;j<hx[i].size();j++)
			{
				int l=c1[hx[i][j]],r=c2[hx[i][j]];
				if(l>1&&now[l-1]!=0)merge(now[l-1],hx[i][j]);
				if(r<m&&now[r+1]!=0)merge(now[r+1],hx[i][j]);
			}
			if(i>1)
			{
				int now=0;
				for(int j=0;j<hx[i].size();j++)
				{
					while(now<hx[i-1].size()&&c2[hx[i-1][now]]<c1[hx[i][j]])now++;
					while(now<hx[i-1].size()&&c2[hx[i-1][now]]<=c2[hx[i][j]])
					{
						merge(hx[i-1][now],hx[i][j]);
						now++;
					}
					if(now<hx[i-1].size()&&c1[hx[i-1][now]]<=c2[hx[i][j]])
					{
						merge(hx[i-1][now],hx[i][j]);
					}
				}
			}
			printf("%lld %d\n",het,lt);
		}
		for(int i=1;i<=k;i++)now[c1[i]]=0;
	}
	return 0;
}