#include <bits/stdc++.h>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

const int N = 3e5 + 500;

int n, m, q, zad[N];
ll cnt[N];

void solve() {
	scanf("%d%d%d", &n, &m, &q);
	for(int i = 0;i <= m;i++) cnt[i] = 0, zad[i] = m;
	int sad = 0, kol = 0;
	for(;q--;) {
		int ty; scanf("%d", &ty);
		if(ty == 1) {
			int x; scanf("%d", &x);
			sad = x; kol = m;
		} else if(ty == 2) {
			int x, id; scanf("%d%d", &id, &x);
			if(x == sad && zad[id] != x) {
				zad[id] = x;
				cnt[id] += kol--; 
			}
		} else {
			int x, id; scanf("%d%d", &id, &x);
			if(x == sad && zad[id] != x) {
				zad[id] = x;
			}
		}
	}
	vector < pair<ll, int> > svi;
	for(int i = 1;i <= m;i++) svi.PB({cnt[i], -i});
	sort(svi.rbegin(), svi.rend());
	for(auto &[x, id] : svi) printf("%d %lld\n", -id, x);
}

int main() {
	int T; scanf("%d", &T);
	for(;T--;) solve();	
	return 0;
}