#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
const int N=1e6+10;
int n,m,a,b,c;
string s;
pii ans[N];
bool vis1[N], vis2[N];
void solve()
{
	int n, m, q;cin >>n >> m >> q;
	int contest_id = 0;
	memset(vis1, 0, sizeof vis1);
	memset(vis2, 0, sizeof vis2);
	int idx = m;
	
	for (int i = 1; i <= m; i ++) {
		ans[i].first = 0;
		ans[i].second = i;
	}
	
	while(q --) {
		int op; cin >> op;
		
		if (op == 1) {
			idx = m;
			int id ; cin >> id ;
			if (vis1[id]) continue ;
			contest_id = id;
			vis1[id] = 1;
			memset(vis2, 0 ,sizeof vis2);
		}
		if(op == 2) {
			int id, x; cin >> id >> x;
			if (x != contest_id) continue ;
			if (vis2[id]) continue ;
			vis2[id] = 1;
			ans[id].first += idx -- ;
		}
		if (op == 3) {
			int id, x; cin >> id >> x;
			if (x != contest_id ) continue ;
			if (vis2[id]) continue ;
			vis2[id] = 1;
		}
	}
	
	sort(ans + 1, ans + 1 + m);
	
	for (int i = m; i >= 1; i --) {
		cout << ans[i].second << ' ' << ans[i].first << '\n';
	}
		
	return ;
}
signed main()
{
	int T;cin>>T;
	while(T--)solve();
	return 0;
}