// created:  Sep/02/2023 22:19:28
#include<cstdio>
#include<vector>
#include<set>
#include<algorithm>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
using namespace std;
template<typename T>void readmain(T &x)
{
	bool neg=false;
	unsigned int c=getchar();
	for(;(c^48)>9;c=getchar())if(c=='-')neg=true;
	for(x=0;(c^48)<10;c=getchar())x=(x<<3)+(x<<1)+(c^48);
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
constexpr int N=1e5+5,INF=0x3f3f3f3f;
int tt,n,m,k,x[N],l[N],r[N],f[N];
int find(int u){return f[u]==u?u:f[u]=find(f[u]);}
vector<int> a[N],b0[N],b1[N];
set<pair<int,int>> s,t;
int main()
{
	read(tt);
	while(tt--)
	{
		read(n,m,k);
		F(i,0,k)
		{
			int r1,c1,r2,c2;read(r1,c1,r2,c2);--r1,--c1,--r2,--c2;
			if(r1==r2)
			{
				x[i]=r1;
				l[i]=c1,r[i]=c2+1;
				a[r1].emplace_back(i);
			}
			else
			{
				x[i]=c1;
				l[i]=r1,r[i]=r2+1;
				b0[l[i]].emplace_back(i);
				b1[r[i]].emplace_back(i);
			}
			f[i]=i;
		}
		int ans=0;
		long long sum=0,cur=0;
		s.clear();
		F(i,0,n)
		{
			cur+=b0[i].size()-b1[i].size();
			sum+=cur;
			ans+=(int)b0[i].size()+(int)a[i].size();
			for(int j:a[i])sum+=r[j]-l[j];
			if(i)
			{
				for(int j:a[i])
				{
					auto il=t.lower_bound({l[j],-INF});
					auto ir=t.lower_bound({r[j],-INF});
					for(auto it=il;it!=ir;++it)
					{
						int v=it->second;
						if(find(j)!=find(v))--ans,f[find(j)]=find(v);
					}
				}
			}
			for(int j:b0[i])
			{
				auto it=t.lower_bound({x[j],-INF});
				if(it!=t.end())
				{
					int v=it->second;
					if(x[j]==x[v]&&find(j)!=find(v))--ans,f[find(j)]=find(v);
				}
			}
			for(int j:b0[i])t.emplace(x[j],j);
			for(int j:b1[i])t.erase({x[j],j});
			for(int j:a[i])
			{
				auto it=t.lower_bound({l[j],0});
				if(it!=t.begin())
				{
					int v=prev(it)->second;
					if(x[v]==l[j]-1&&find(j)!=find(v))--ans,f[find(j)]=find(v);
				}
				if(it!=t.end())
				{
					int v=it->second;
					if(x[v]==r[j]&&find(j)!=find(v))--ans,f[find(j)]=find(v);
				}
			}
			for(int j:b0[i])
			{
				auto it=t.find({x[j],j});
				if(it!=t.begin())
				{
					int v=prev(it)->second;
					if(x[v]==x[j]-1&&find(j)!=find(v))--ans,f[find(j)]=find(v);
				}
				if(next(it)!=t.end())
				{
					int v=next(it)->second;
					if(x[v]==x[j]+1&&find(j)!=find(v))--ans,f[find(j)]=find(v);
				}
			}
			sort(a[i].begin(),a[i].end(),[](int u,int v){return l[u]<l[v];});
			if(!a[i].empty())for(auto it=a[i].begin();next(it)!=a[i].end();++it)
			{
				if(r[*it]==l[*next(it)])
				{
					int u=*it,y=*next(it);
					if(find(u)!=find(y))--ans,f[find(u)]=find(y);
				}
			}
			if(i)
			{
				for(int j:b0[i])
				{
					auto it=s.lower_bound({x[j],INF});
					if(it!=s.begin())
					{
						--it;
						int v=it->second;
						if(x[j]<r[v]&&find(j)!=find(v))--ans,f[find(j)]=find(v);
					}
				}
				for(int j:a[i])
				{
					auto it=s.lower_bound({l[j],INF});
					if(it!=s.begin())
					{
						int v=prev(it)->second;
						if(l[j]<r[v]&&find(j)!=find(v))--ans,f[find(j)]=find(v);
					}
				}
			}
			s.clear();
			for(int j:a[i])s.emplace(l[j],j);
			if(i)
			{
				for(int j:a[i-1])
				{
					auto it=s.lower_bound({l[j],INF});
					if(it!=s.begin())
					{
						int v=prev(it)->second;
						if(l[j]<r[v]&&find(j)!=find(v))--ans,f[find(j)]=find(v);
					}
				}
			}
			printf("%lld %d\n",sum,ans);
		}
		t.clear();
		F(i,0,n+1)a[i].clear(),b0[i].clear(),b1[i].clear();
	}
	return 0;
}