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

#define ll long long
#define ld long double
#define endl '\n'

#define MOD 998244353
#define MXN 500'500

mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());
int randint(int lb, int ub)
{ return uniform_int_distribution<int>(lb, ub)(gen); }


ll n, m, q;
ll arr[MXN];
bool isActive[MXN];
set<int> isCompleted[MXN], isGiveup[MXN];
ll score[MXN];

void solve() {
	cin >> n >> m >> q;

	fill(isActive, isActive+n+1, 0);
	for(int i = 0; i <= n; i++){
		isCompleted[i].clear();
		isGiveup[i].clear();
	}
	for(int i = 0; i <= m; i++)
		score[i] = 0;
	
	while(q--){
		int op, x, y; cin >> op;
		if(op == 1){
			int x; cin >> x;
			isActive[x] = 1;
		}
		else if(op == 2){
			cin >> x >> y;
			if(!isActive[y] || isGiveup[y].count(x) || isCompleted[y].count(x))	continue;
			score[x] += m - isCompleted[y].size();
			isCompleted[y].insert(x);
		}
		else if(op == 3){
			cin >> x >> y;
			if(!isActive[y] || isGiveup[y].count(x) || isCompleted[y].count(x))	continue;
			isGiveup[y].insert(x);
		}
	}

	vector<int> ord(m);
	iota(ord.begin(), ord.end(), 1);
	sort(ord.begin(), ord.end(), [&](const int lhs, const int rhs){
		if(score[lhs] != score[rhs])
			return score[lhs] > score[rhs];
		return lhs < rhs;
	});
	for(int i = 0; i < m; i++)
		cout << ord[i] << " " << score[ord[i]] << endl;
	
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	// freopen("input.txt", "r", stdin);
	// freopen("output.txt", "w", stdout);
	int T = 1;
	cin >> T;
	for(int cas = 1; cas <= T; cas++){
		// cout << "Case #" << cas << ": ";
		solve();
	}
	return 0;
}
/*


*/