#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void solve() {
    int n, m, q;
    cin >> n >> m >> q;
    vector<int> level_ok(n + 1);
    vector<set<int> > ok(m + 1); //第i个人完成的level
    vector<set<int> > giup(m + 1); //第i个人放弃的level
    vector<ll> pts(n + 1, m); //第i个level的分数
    vector<ll> getp(m + 1); //每个人的分数
    for (int _ = 1; _ <= q; ++_) {
        int ty;
        cin >> ty;
        if (ty == 1) {
            int x;
            cin >> x;
            level_ok[x] = 1;
        } else if (ty == 2) {
            int id, x;
            cin >> id >> x;
            if (!level_ok[x]) continue;
            if (giup[id].count(x) != 0) continue;
            if (ok[id].count(x) != 0) continue;
            getp[id] += pts[x];
            pts[x]--;
            ok[id].insert(x);
        } else {
            int id, x;
            cin >> id >> x;
            if (!level_ok[x]) continue;
            if (giup[id].count(x) != 0) continue;
            if (ok[id].count(x) != 0) continue;
            giup[id].insert(x);
        }
    }
    vector<int> id(m + 1);
    iota(id.begin(), id.end(), 0);
    sort(id.begin() + 1, id.end(), [&](const int x, const int y) {
        if (getp[x] == getp[y]) return x < y;
        return getp[x] > getp[y];
    });

    for (int i = 1; i <= m; ++i) {
        cout << id[i] << " " << getp[id[i]] << "\n";
    }
}

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);
    
    int _;
    cin >> _;
    while (_--) solve();

    return 0;
}