#include<bits/stdc++.h>

using namespace std;
using  LL = long long;

#define int long long
#define rep(i,a,b) for(int i = a;i<=b;i++)
#define pre(i, a, b) for(int i = a;i >= b;i--)

int n, m, q;
int x[100005];
struct node {
    int xi;
    int ans;
};
node a[100005];
map<int, int>mp[100005];

void init()
{
    rep(i, 1, m)
    {
        mp[i].clear();
        a[i].ans = 0;
        a[i].xi = i;
        x[i] = m;
    }
}

bool cmp(node x, node y)
{
    if (x.ans != y.ans)return x.ans > y.ans;
    return x.xi < y.xi;
}

void solve()
{
    int now = 0;
    cin >> n >> m >> q;
    init();
    while (q--)
    {
        int p; cin >> p;
        int id, xx;
        if (p == 1) {
            cin >> now;
        }
        else if (p == 2)
        {
            cin >> id >> xx;
            if (xx != now) continue;
            if (mp[id][xx] == 1) continue;
            mp[id][xx] = 1;
            a[id].ans += x[xx];
            if (x[xx] > 0) x[xx]--;
        }
        else
        {
            cin >> id >> xx;
            if (xx != now) continue;
            if (mp[id][xx] == 1) continue;
            mp[id][xx] = 1;
        }
    }
    sort(a + 1, a + m + 1, cmp);
    rep(i, 1, m) cout << a[i].xi << " " << a[i].ans << endl;
    return;
}

signed main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;

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

    return  0;

}