#include<bits/stdc++.h>
using namespace std;

const int N=2e5+10;

int n,m,k,q;
string s;
void solve(){
	set<int>st;
	cin>>n>>m>>q;
	int id=0,rk=m;
	vector<int>a(m+1,0);
	for(int i=1;i<=q;i++){
		int op,idd,x;
		cin>>op>>idd;
		if(op!=1) cin>>x;
		if(id==0&&op!=1) continue;
		if(op==1){
			id=idd;
			rk=m;
			st.clear();
		}
		else if(op==2){
			if(x!=id) continue;
			if(st.count(idd)) continue;
			a[idd]+=rk; rk--;
			st.insert(idd);
		}
		else{
			if(x!=id) continue;
			if(st.count(idd)) continue;
			st.insert(idd);
		}
	}
	vector<pair<int,int>>b;
	for(int i=1;i<=m;i++){
		b.push_back({-a[i],i});
	}
	sort(b.begin(),b.end());
	for(auto z:b){
		auto x=z.first;
		auto y=z.second;
		cout<<y<<' '<<-x<<endl;
	}
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0);
	int t; cin>>t;
	while(t--) solve();
	return 0;
}