#include<iostream>
#include<cstdio>
#include<set>
#include<vector>
#define N 500000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int r1,c1,r2,c2,num;
};
struct lines
{
	int l,r,num;
	bool operator < (const lines &t)const
	{
		return r<t.r;
	}
};
set<lines>s[N+1];
set<lines>s2[N+1];
int T,n,m,k,scnt,cnt[N+1],st[N+1],rt[N+1];
bool vis[N+1];
vector<reads>p[N+1];
vector<int>E[N+1];
int find(int x)
{
	if (rt[x]==x) return x;
	return rt[x]=find(rt[x]);
}
void unionn(int x,int y)
{
	rt[x]=y;
	return;
}
void adder(int x,int l,int r,int c)
{
	s[x].insert((lines){l,r,c});
	return;
}
void adder2(int x,int l,int r,int c)
{
	s2[x].insert((lines){l,r,c});
	return;
}
int query(int x,int y)
{
	if (x<0||x>n||y<0||y>m) return -1;
	auto it=s[x].lower_bound((lines){0,y,0});
	if (it!=s[x].end()&&(*it).l<=y) return (*it).num;
	it=s2[y].lower_bound((lines){0,x,0});
	if (it!=s2[y].end()&&(*it).l<=x) return (*it).num;
	return -1;
}
int main()
{
	int r1,c1,r2,c2,x,y;
	T=read();
	while (T--)
	{
		n=read(),m=read(),k=read(),scnt=0;
		for (int i=1;i<=n;++i) p[i].clear(),s[i].clear(),cnt[i]=st[i]=0;
		for (int i=1;i<=m;++i) s2[i].clear();
		for (int i=1;i<=k;++i)
		{
			r1=read(),c1=read(),r2=read(),c2=read(),p[min(r1,r2)].push_back((reads){r1,c1,r2,c2,i}),rt[i]=i,E[i].clear(),vis[i]=0;
			if (r1==r2) cnt[r1]+=c2-c1+1;
			else st[r1]++,st[r2+1]--;
		}
		for (int i=1;i<=n;++i) st[i]+=st[i-1],cnt[i]+=st[i];
		for (int i=1;i<=n;++i) cnt[i]+=cnt[i-1];
		for (int i=1;i<=n;++i)
			for (int j=0;j<p[i].size();++j)
			{
				if (p[i][j].r1==p[i][j].r2) adder(p[i][j].r1,p[i][j].c1,p[i][j].c2,p[i][j].num);
				else adder2(p[i][j].c1,p[i][j].r1,p[i][j].r2,p[i][j].num);
			}
		for (int i=1;i<=n;++i)
			for (int j=0;j<p[i].size();++j)
			{
				for (int op=-1;op<=1;++op)
					for (int op2=-1;op2<=1;++op2)
						if (abs(op)+abs(op2)==1&&query(p[i][j].r1+op,p[i][j].c1+op2)!=-1&&p[i][j].num!=query(p[i][j].r1+op,p[i][j].c1+op2))
						{
							x=p[i][j].num,y=query(p[i][j].r1+op,p[i][j].c1+op2);
							if (x<y) swap(x,y);
							E[x].push_back(y),E[y].push_back(x);
						}
				for (int op=-1;op<=1;++op)
					for (int op2=-1;op2<=1;++op2)
						if (abs(op)+abs(op2)==1&&query(p[i][j].r2+op,p[i][j].c2+op2)!=-1&&p[i][j].num!=query(p[i][j].r2+op,p[i][j].c2+op2))
						{
							x=p[i][j].num,y=query(p[i][j].r2+op,p[i][j].c2+op2);
							if (x<y) swap(x,y);
							E[x].push_back(y),E[y].push_back(x);
						}
			}
		for (int i=1;i<=n;++i)
		{
			for (int j=0;j<p[i].size();++j)
			{
				scnt++;
				for (int k=0;k<E[p[i][j].num].size();++k)
					if (find(E[p[i][j].num][k])!=find(p[i][j].num)&&vis[E[p[i][j].num][k]])
						unionn(find(E[p[i][j].num][k]),find(p[i][j].num)),scnt--;
				vis[p[i][j].num]=1;
			}
			printf("%d %d\n",cnt[i],scnt);
		}
	}
	return 0;
}