#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
struct Node{
	ll id;
	ll score;
	bool operator <(const Node &a)const{
		if(a.score == score){
			return id < a.id;
		}
		else{
			return score > a.score;
		}
	}
}play[N];
bool open[N];
map<pair<int, int>, bool> ed; // {id, x} = false 未放弃|未完成 
ll lv[N];
void solve(){
	ll n, m, q;
	cin >> n >> m >> q;
	for(int i = 1; i <= n; i++){
		lv[i] = m;
		open[i] = false;
	}
	for(int i = 1; i <= m; i++){
		play[i].score = 0;
		play[i].id = i;
	}
	ed.clear();
	while(q--){
		int op; cin >> op;
		if(op == 1){
			int x; cin >> x;
			open[x] = true; // true 为开启 
		}
		else if(op == 2){
			int id, x;
			cin >> id >> x;
			if(open[x] == true && ed[{id, x}] == false){
				play[id].score += lv[x];
				lv[x]--;
				ed[{id, x}] = true;
			}
		}
		else{
			int id, x; cin >> id >> x;
			ed[{id, x}] = true;
		}
	}
	sort(play + 1, play + 1 + m);
	//cout << "-----\n";
	for(int i = 1; i <= m; i++){
		cout << play[i].id << " " << play[i].score << "\n";
	}//cout << "-----\n";
}
int main(){
	int t; cin >> t;
	while(t--){
		solve();
		//cout << "\n";
	}	
}