#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<i64, i64>;
void solve()
{
    int n, m, q;
    cin >> n >> m >> q;
    vector<set<int> > st(n + 1);
    vector<set<int> > oc(m + 1);
    vector<int> vis(n + 1);
    vector<pii> ans(m);
    for (int i=0;i<m;++i) ans[i].second = i + 1;
    while (q--)
    {
        int o;
        cin >> o;
        if (o == 1)
        {
            int x;
            cin >> x;
            vis[x] = 1;
        }
        else
        {
            int x, y;
            cin >> x >> y;
            if (!vis[y]) continue;
            if (oc[x].count(y)) continue;
            oc[x].insert(y);
            if (o == 3) continue;
            ans[x - 1].first += m - st[y].size();
            st[y].insert(x);
        }
    }
    sort(ans.begin(), ans.end(), [](pii x, pii y) {return x.first == y.first ? x.second < y.second : x.first > y.first;});
    for (auto [x, y] : ans) cout << y << ' ' << x << '\n';
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) solve();
    return 0;
}