#include <bits/stdc++.h>
#define N (200000 + 10)  /*------------------ #define ------------------*/
#define M (400000 + 10)
#define MOD (1000000000 + 7)
//#define MOD (998244353)
#define INF (0x3f3f3f3f)
#define LNF (3e18)
#define mod(a,b) (((a)%(b)+(b))%(b))
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,LL> PIL;
typedef pair<LL,int> PLI;
typedef pair<double,double> PDD;

auto solve(){
	
	int n,m,Q;
	cin >> n >> m >> Q;
	
	vector<int> s(n + 1,0);
	int now_game = -1;
	int score = 0;
	set<int> dead;
	while(Q -- ){
		int op;
		cin >> op;
		if(op == 1){
			score = m;
			dead.clear();
			cin >> now_game;
		}else if(op == 2){
			int ix,game;
			cin >> ix >> game;
			if(dead.count(ix)) continue;
			if(game == now_game){
				//cout << "A\n";
				dead.insert(ix);
				s[ix] += score;
				if(score > 0) score -- ;
			}
		}else{
			int ix,game;
			cin >> ix >> game;
			if(dead.count(ix)) continue;
			if(game == now_game) dead.insert(ix);
		}
		//cout << "B : " << now_game << "\n";
	}
	
	vector<PII> ans;
	for(int i = 1;i <= m;i ++ ) ans.push_back({s[i] == -1 ? 0 : s[i],i});
	
	sort(ans.begin(),ans.end(),[&](PII a,PII b){
		if(a.fi != b.fi) return a.fi > b.fi;
		return a.se < b.se;
	});
	
	for(auto t : ans)
		cout << t.se << ' ' << t.fi << '\n';
}

signed main(){
	IOS
	int T = 1;
	cin >> T;
	while(T -- ) solve();
	//while(T -- ) cout << (solve() ? "YES" : "NO") << '\n';

    return 0;
}