#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
using i64 = long long;
using pii = pair<int,int>;

int t;

int n, m, q;

bool cmp(pii x, pii y) {
	if (x.se > y.se) {
		return true;
	}
	else if (x.se == y.se) {
		return x.fi < y.fi;
	}
	else {
		return false;
	}
}

void solve() {
	cin >> n >> m >> q;
	vector<pii> v(m+10);
	vector<bool> st(m+10,0);
	queue<int> com;
	for (int i = 1; i <= m; i++) {
		v[i] = {i,0};
	}
	int lv = 0;
	int c = m;
	while (q--) {
		int op, id, x;
		cin >> op;
		if (op == 1) {
			cin >> lv;
			c = m;
			while (!com.empty()) {
				int u = com.front();
				st[u] = 0;
				com.pop();
			}
		}
		else if (op == 2) {
			cin >> id >> x;
			if (!st[id] && x == lv) {
				st[id] = 1;
				v[id].se += c;
				c--;
				com.push(id);
			}
		}
		else {
			cin >> id >> x;
			if (!st[id] && x == lv) {
				st[id] = 1;
				com.push(id);
			}
		}
	}
	sort(v.begin()+1,v.begin()+1+m,cmp);
	for (int i = 1; i <= m; i++) {
		printf("%d %d\n", v[i].fi, v[i].se);
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}