#include <bits/stdc++.h>

namespace stdv = std::views;
namespace stdr = std::ranges;

using i64 = long long;

void solve() {
    int n, m, q;
    scanf("%d%d%d", &n, &m, &q);

    std::vector<int> w(n, -1);
    std::vector<i64> a(m);
    std::vector<std::set<int>> vis(n);

    int last = -1;
    while (q--) {
        int o, id, x;
        scanf("%d", &o);
        if (o == 1) {
            scanf("%d", &x);
            x--;
            w[x] = m;
            if (last != -1) {
                w[last] = -1;
                last = x;
            }
        } else if (o == 2) {
            scanf("%d%d", &id, &x);
            id--;
            x--;

            if (vis[x].contains(id) || w[x] == -1) {
                continue;
            }

            vis[x].insert(id);
            a[id] += w[x]--;
        } else {
            scanf("%d%d", &id, &x);
            id--;
            x--;

            if (w[x] == -1) {
                continue;
            }
            vis[x].insert(id);
        }
    }

    std::vector<int> o(m);
    std::iota(o.begin(), o.end(), 0);
    stdr::sort(o, [&](int i, int j) {
        if (a[i] == a[j]) {
            return i < j;
        }
        return a[i] > a[j];
    });

    for (auto i : o) {
        printf("%lld %d\n", i + 1, a[i]);
    }
}

auto main() -> int {
    int t;
    scanf("%d", &t);

    while (t--) {
        solve();
    }

    return 0;
}