#include <bits/stdc++.h>
using namespace std;
#define int long long
using LL = long long;
using ll = long long;
const int N=114514;
unordered_map<int,int > vis[N];
int n,m,q,now,cnt[N];
struct player {
    int x,id;
}a[N],b;
bool cmp(player a,player b) {
    if(a.x==b.x)return a.id<b.id;
    return a.x>b.x;
}
void solve() {
    scanf("%lld%lld%lld",&n,&m,&q);

    for(int i=1;i<=max(n,m);i++)vis[i].clear(),cnt[i]=0,a[i].x=0,a[i].id=i;
    for(int i=1;i<=q;i++) {
        int op,x,y;
        scanf("%lld%lld",&op,&x);

        if(op==1) {
            now=x;
        }if(op==2) {
            scanf("%lld",&y);
            if(y!=now)continue;
            if(vis[y][x]==1)continue;
            vis[y][x]=1;
            a[x].x+=m-cnt[y];
            cnt[y]++;
        }if(op==3) {
            scanf("%lld",&y);
            if(y!=now)continue;
            if(vis[y][x]==1)continue;
            vis[y][x]=1;
        }
    }
    sort(a+1,a+m+1,cmp);
    for(int i=1;i<=m;i++) {
        printf("%lld %lld\n",a[i].id,a[i].x);
    }
}

signed main() {


    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}
/*
 3
3 4 6
1 2
2 1 1
2 2 2
3 3 2
2 3 2
2 1 2
3 4 8
1 2
2 1 1
2 2 2
3 3 2
2 3 2
2 1 2
1 1
2 1 1
3 4 7
1 2
2 1 1
2 2 2
3 3 2
2 3 2
2 1 2
1 1
 */