#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define int ll

const int N=1e5+100;

int u[N],d[N];
vector<int> start[N],stop[N];

int comps;
int par[N];

void init(int v)
{
//    cout<<"init "<<v<<"\n";
    par[v]=v;
    comps++;
}

int dsu(int v)
{
    return par[v]==v?v:par[v]=dsu(par[v]);
}

void un(int u,int v)
{
//    cout<<"un "<<u<<" "<<v<<"\n";
    u=dsu(u);
    v=dsu(v);
    if(u==v)
        return;
    comps--;
    if(rand()%2)
        par[u]=v;
    else
        par[v]=u;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int T;
    cin>>T;
    while(T--)
    {
        int n,m,k;
        cin>>m>>n>>k;
        for(int i=1;i<=m;i++)
            start[i].clear(),
            stop[i].clear();
        for(int i=1;i<=k;i++)
        {
            int l,r;
            cin>>l>>u[i]>>r>>d[i];
            start[l].push_back(i);
            stop[r].push_back(i);
        }
        set<tuple<int,int,int>> segs;
//        cout<<"testcase\n";
        comps=0;
        int sum=0,cur=0;
        for(int i=1;i<=m;i++)
        {
//            cout<<"i="<<i<<"\n";
            set<tuple<int,int,int>> del;
            for(int j:stop[i-1])
            {
                segs.erase({u[j],d[j],j});
                del.emplace(u[j],d[j],j);
                cur-=d[j]-u[j]+1;
            }
            for(int j:start[i])
            {
                cur+=d[j]-u[j]+1;
                init(j);
                int U=u[j],D=d[j];
                auto it=del.lower_bound({U,-1,-1});
                if(it!=del.begin())
                    it--;
                for(;it!=del.end();it++)
                {
                    auto[UU,DD,jj]=*it;
                    if(DD<U)
                        continue;
                    if(UU>D)
                        break;
                    un(j,jj);
                }
                it=segs.lower_bound({U,-1,-1});
                if(it!=segs.end())
                {
                    auto[UU,DD,jj]=*it;
                    if(UU==D+1)
                        un(j,jj);
                }
                if(it!=segs.begin())
                {
                    it--;
                    auto[UU,DD,jj]=*it;
                    if(U==DD+1)
                        un(j,jj);
                }
                segs.insert({U,D,j});
            }
            sum+=cur;
            cout<<sum<<" "<<comps<<"\n";
        }
    }
}