#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size()
#define fi first
#define se second
typedef long long int ll;
typedef pair<ll,ll> pii;
const int MAXN = 2e5+5;
pii a[MAXN];
int last[MAXN]; //the last level the players are on
int comp[MAXN]; //whether someone completed this level
int lvl;
int main()
{
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int tc;
	cin>>tc;
	while(tc--){
		int n,m,q;
		cin>>n>>m>>q;
		
		for(int i=1;i<=m;i++){
			last[i] = -1;
			a[i].se = 0;
			a[i].fi = i;
		}
		for(int i=1;i<=n;i++)comp[i] = 0;
		lvl = 0;
		
		for(int i=0;i<q;i++){
			int t;
			cin>>t;
			if(t==1){
				int x;
				cin>>x;
				lvl = x;
			}else{
				
				int id,x;
				cin>>id>>x;
				
				if(!lvl)continue;
				if(x != lvl)continue;
				if(last[id] == lvl)continue;
				
				last[id] = lvl;
				if(t == 2){
					a[id].se += m-1;
					if(!comp[lvl]){
						comp[lvl]  =1;
						a[id].se ++;
					}
				}
			}
			
		}
		sort(a+1,a+m+1,[&](pii x, pii y){
			if(x.se == y.se)return y.fi > x.fi;
			return y.se < x.se;
		});
		for(int i=1;i<=m;i++)cout<<a[i].fi<<" "<<a[i].se<<'\n';
	}
	
}