#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
struct node {
    int id, sum;
};
void solve() {
	int n, m, q;
    cin >> n >> m >> q;
    vector<node> a(m + 1);
    for (int i = 1; i <= m; i++) {
        a[i].id = i;
    }
    int now = 0, cnt = m;
    set<int> st;
    while (q--) {
        int op, i, x;
        cin >> op;
        if (op == 1) {
            cin >> x;
            now = x;
            cnt = m;
        } else if (op == 2){
            cin >> i >> x;
            if (st.find(i) == st.end() && x == now) {
                a[i].sum += cnt;
                cnt = max(cnt - 1, 0);
            }
        } else {
            cin >> i >> x;
            if (x == now)
                st.insert(i);
        }    
    } 
    sort(a.begin() + 1, a.end(), [&](node &x, node &y) {
       return x.sum != y.sum ? x.sum > y.sum : x.id < y.id; 
    });
    for (int i = 1; i <= m; i++) {
        cout << a[i].id << " " << a[i].sum << endl;
    }
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}