#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
const int N=int(1e5)+10;
int cnt[N],score[N],p[N],n,m,q;
bool active[N];
set<int>s[N];
int main()
{
    int T;
    for(scanf("%d",&T);T--;)
    {
        scanf("%d%d%d",&n,&m,&q);
        rep(i,m)s[i].clear(),score[i]=0;
        rep(i,n)active[i]=0,cnt[i]=0;
        rep(i,q)
        {
            int opt,id,x;scanf("%d",&opt);
            if(opt==1)
            {
                scanf("%d",&x);
                active[x]=1;
            }
            else if(opt==2)
            {
                scanf("%d%d",&id,&x);
                if(!active[x])continue;
                if(s[id].contains(x))continue;
                s[id].insert(x);
                score[id]+=m-cnt[x];
                cnt[x]++;
            }
            else if(opt==3)
            {
                scanf("%d%d",&id,&x);
                if(!active[x])continue;
                s[id].insert(x);
            }
        }
        rep(i,m)p[i]=i;
        sort(p+1,p+m+1,[&](int x,int y){return score[x]!=score[y]?score[x]>score[y]:x<y;});
        rep(i,m)printf("%d %d\n",p[i],score[p[i]]);
    }
    return 0;
}