/*
 * @Author: error: error: git config user.name & please set dead value or install git && error: git config user.email & please set dead value or install git & please set dead value or install git
 * @Date: 2024-11-09 21:05:29
 * @LastEditors: error: error: git config user.name & please set dead value or install git && error: git config user.email & please set dead value or install git & please set dead value or install git
 * @LastEditTime: 2024-11-09 21:26:09
 * @FilePath: \.vscode\J_Grand_Prix_of_Ballance.cpp
 * @Description: 这是默认设置,请设置`customMade`, 打开koroFileHeader查看配置 进行设置: https://github.com/OBKoro1/koro1FileHeader/wiki/%E9%85%8D%E7%BD%AE
 */
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int N=1e5+10;
const int MOD=1;

bool cmp(pair<int,int> a, pair<int,int> b){
    if(a.second==b.second) return a.first<b.first;
    else return a.second>b.second;
}

int cnt[N], vis[N], ans[N];
pair<int, int> p[N]; 
map<pair<int,int>,int> mp; 
void solve() {
    int n, m, q;
    cin >> n >> m >> q;

    fill(cnt, cnt + n + 1, 0); 
    fill(vis, vis + n + 1, 0); 
    fill(ans, ans + m + 1, 0); 
    mp.clear();
    
    for(int i=1; i<=q; i++){
        int op;
        cin >> op;
        if(op==1){
            int x;
            cin >> x;
            vis[x]=1;
        }else if(op==2){
            int id,x;
            cin >> id >> x;
            if(vis[x]==0 || mp[{id,x}]!=0) continue;
            mp[{id,x}]=1; // 完成
            ans[id]+=m-cnt[x];
            if(cnt[x]!=m){
                cnt[x]++;
            }
            //cnt[x]++;   
        }else{
            int id,x;
            cin >> id >> x;
            if(vis[x]==0 || mp[{id,x}]!=0) continue;
            mp[{id,x}]=2; // 弃权
        }
    }
    for(int i=1; i<=m; i++){
        p[i] = {i,ans[i]};
    }
    sort(p + 1, p + m + 1, cmp); // 排序
    for(int i=1; i<=m; i++){
        cout << p[i].first << " " << p[i].second << endl;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _=1;
    cin >> _;
    while(_--) {
        solve();
    }
    return 0;
}