#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
struct node{
	ll id;
	ll score;
}p[N];
map<int, int>chk;
bool cmp(node x, node y){
	if(x.score == y.score) return x.id < y.id;
	return x.score > y.score;
}
void slove(){
	chk.clear();
	int n, m, q;
	cin >> n >> m >> q;
	for(int i = 1 ; i <= m ; i++){
		p[i].id = i;
		p[i].score = 0;
	}
	int type, id, x, now = 0, cnt = 0;
	for(int i = 1 ; i <= q ; i++){
		cin >> type;
		if(type == 1){
			cin >> now;
			cnt = m;
		} 
		else if(type == 2){
			cin >> id >> x;
			if(!now) continue;
			if(chk[id]) continue;
			if(x != now) continue;
			chk[id] = x;
			p[id].score += cnt;
			cnt--;
		}
		else{
			cin >> id >> x;
			chk[id] = x;
		}
	}
	sort(p+1, p+m+1, cmp);
	for(int i = 1 ; i <= m ; i++) cout << p[i].id << ' ' << p[i].score << '\n';
}
int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int t;
	cin >> t;
	while(t--) slove();
	return 0;
}