/*

Author: Haze

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll readL() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

inline int read() {
    return (int) (readL());
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

void solve() {
    int n = read(), m = read(), q = read();
    vector<int>open(n, -1);
    set<array<int, 2>>S;//level player
    vector<int>point(m);
    while(q --){
        int op = read();
        if(op == 1){
            int x = read();
            open[x - 1] = m;
        }
        if(op == 2){
            int id = read() - 1, lev = read() - 1;
            if(open[lev] == -1)continue;
            if(S.find({lev, id}) != S.end()){
                continue;
            }
            S.insert({lev, id});
            point[id] += open[lev];
            open[lev] --;
        }
        if(op == 3){
            int id = read() - 1, lev = read() - 1;
            if(open[lev] == -1)continue;
            if(S.find({lev, id}) != S.end()){
                continue;
            }
            S.insert({lev, id});

        }
    }
    vector<array<int, 2>>ans(m);
    irep(i, 0, m - 1){
        ans[i] = {point[i], i + 1};
    }
    sort(ans.begin(), ans.end(), [&](auto A, auto B){
        return make_pair(B[0], A[1]) < make_pair( A[0], B[1]);
    });
    for(auto [u, v] : ans)
        cout << v << ' ' << u << '\n';
}

int main() {
    // IOS
    int T = read();
    while (T--) {
        solve();
    }
    return 0;
}