#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define int long long
int n,m,q;
struct node{
    int id,score;
};
void solve(){
    cin>>n>>m>>q;
    vector<bool> game_state(n+10,false);
    //map[id,x]
    map<pair<int,int>,int> mp;//1:complete,-1:giveup
    vector<int> game_rank(n+10,0);
    vector<node> player(m+10);
    for(int i=1;i<=m;i++){
        player[i].id=i;
    }
    while(q--){
        int op;cin>>op;
        if(op==1){
            int x;cin>>x;
            game_state[x]=1;
        }else if(op==2){

            int id,x;cin>>id>>x;
            if(!game_state[x]) continue;
            if(!mp[{id,x}]){
                mp[{id,x}]=1;

                player[id].score+=m-game_rank[x];
                game_rank[x]++;
            }
        }else{
            int id,x;cin>>id>>x;
            if(!game_state[x]) continue;
            if(!mp[{id,x}]){
                mp[{id,x}]=-1;
            }
        }
    }
    sort(player.begin()+1,player.begin()+m,[&](node a,node b){
        if(a.score==b.score) return a.id<b.id;
        return a.score>b.score;
    });

    for(int i=1;i<=m;i++){
        cout<<player[i].id<<' '<<player[i].score<<'\n';
    }
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int _;cin>>_;
    while(_--) solve();
}