#define _CRT_SECURE_NO_WARNINGS 1
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX = 0x3f3f3f3f;
const ll mod = 998244353;
const ll N = 2e5 + 10;

int n, m, q;
set<int> st;
struct per {
	int id, point = 0;
	set<int> st;
	bool operator < (const per& u)const {
		if (point == u.point)return id < u.id;
		return point > u.point;
	}
}pp[N];
struct bs {
	int now = m;
	bool begin = 0;
}bb[N];
void solve() {
	cin >> n >> m >> q;
	for (int i = 1; i <= m; i++) {
		pp[i].id = i; pp[i].point = 0; pp[i].st.clear();
	}
	for (int i = 1; i <= n; i++) {
		bb[i].begin = 0; bb[i].now = m;
	}
	for (int i = 1; i <= q; i++) {
		int t; cin >> t;
		if (t == 1) {
			int com; cin >> com;
			bb[com].begin = 1;
		}
		else if (t == 2) {
			int b, c; cin >> b >> c;
			if (bb[c].begin && pp[b].st.count(c)==0) {
				pp[b].point += bb[c].now;
				bb[c].now--;
				pp[b].st.insert(c);
			}
		}
		else {
			int b, c; cin >> b >> c;
			if (bb[c].begin && pp[b].st.count(c)==0) {
				pp[b].st.insert(c);
			}
		}
	}
	sort(pp + 1, pp + 1 + m);
	for (int i = 1; i <= m; i++) {
		cout << pp[i].id << " " << pp[i].point << endl;
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--)
		solve();
	return 0;
}