#include <map>
#include <set>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define pb push_back
#define pp pop_back()
#define int long long
#define laile cout<<"laile"<<endl
#define lowbit(x) ((x)&(-x))
#define double long double
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld %lld",&x,&y)
#define sd(x) scanf("%Lf",&x)
#define sdd(x,y) scanf("%Lf %Lf",&x,&y)
#define _for(i,n) for(int i=0;i<(n);++i)
#define _rep(i,a,b) for(int i=(a);i<=(b);++i)
#define _pre(i,a,b) for(int i=(a);i>=(b);--i)
#define all(x) (x).begin(), (x).end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef unsigned long long ULL;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
const int N=1e6+10,INF=4e18;
int n,m,k,op,level=-1;
bool bl[N];
bool cmp(PII a,PII b)
{
	if(a.se==b.se)return a.fi<b.fi;
	return a.se>b.se;
}
int res[N];
void solve()
{
	cin>>n>>m>>k;
	int now;
	vector<int>cun;
	_rep(i,1,k)
	{
		int id,nowlevel;
		cin>>op;
		if(op==1)
		{
			cin>>level;
			now=m;
			while(cun.size())
			{
				bl[cun.back()]=false;
				cun.pp;
			}
		}
		else 
		{
			cin>>id>>nowlevel;
			if(nowlevel!=level)continue;
			if(bl[id])continue;
			cun.pb(id);
			bl[id]=true;
			if(op==3)continue;
			res[id]+=now--;
		}
	}
	vector<PII>ans;
	_rep(i,1,m)
	{
		ans.pb({i,res[i]});
		res[i]=0;
	}
	while(cun.size())
	{
		bl[cun.back()]=false;
		cun.pp;
	}
	sort(all(ans),cmp);
	for(auto i:ans)cout<<i.fi<<" "<<i.se<<'\n';
	return ;
}
signed main()
{
	IOS;
	int T=1;
    cin>>T;
	while(T--)
		solve();
	return 0;
}