#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0), cin.tie(0)
// #define int long long 
#define pb push_back
#define fi first
#define se second
using namespace std;


typedef pair<int, int> PII;

void solve(){
    int n, m, q;
    cin >> n >> m >> q;

    vector<int> hs;
    vector<int> ans(m + 10, 0), gs(m + 10, 0);

    int tm = m, now;
    for(int i = 1; i <= q; i ++){
        int tp;
        cin >> tp;
        int id, tnow;
        if(tp == 1){
            tm = m;
            for(auto x : hs)
                gs[x] = 0;
            cin >> now;
            hs.clear();
        }else if(tp == 2){
            cin >> id >> tnow;
            if(tnow != now)continue;
            if(gs[id] == 1)continue;
            else {
                gs[id] = 1;
                ans[id] += tm;
                tm --;
                hs.pb(id);
            }
        }else if(tp == 3){
            cin >> id >> tnow;
            if(tnow != now)continue;
            if(gs[id] == 1)continue;
            else {
                gs[id] = 1;
                hs.pb(id);
            }
        }
    }

    vector<PII> idx(m + 10);
    for(int i = 1; i <= m; i ++){
        idx[i] = {ans[i], i};
    }
    auto cmp =[&](PII a, PII b){
        if(a.fi != b.fi)return a.fi > b.fi;
        return a.se < b.se;
    };
    sort(idx.begin() + 1, idx.begin() + 1 + m, cmp);
    
    for(int i = 1; i <= m; i ++){
        auto [ans, id] = idx[i];
        cout << id << " " << ans << endl;
    }

}
signed main(){
    ios;
    int T = 1;
    cin >> T;

    while(T --)
        solve();
}