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

int main()
{
	int T;
	scanf("%d", &T);
	while(T --)
	{
		int n, m, q;
		scanf("%d%d%d", &n, &m, &q);
		int nowlevel = 1;
		vector<vector<int> > finish(n + 1);
		vector<set<int> > vis(n + 1);
		while(q --)
		{
			int op;
			scanf("%d", &op);
			if(op == 1)
			{
				int x;
				scanf("%d", &x);
				nowlevel = x;
			}
			else if(op == 2)
			{
				int id, x;
				scanf("%d%d", &id, &x);
				if(x != nowlevel) continue;
				if(vis[x].count(id) == 1) continue;
				finish[x].push_back(id);
			}
			else
			{
				int id, x;
				scanf("%d%d", &id, &x);
				if(x != nowlevel) continue;
				vis[x].insert(id);
			}
		}

		vector<ll> ans(m + 1);
		for(int i = 1; i <= n; i ++)
		{
			int v = m;
			for(auto j : finish[i])
				ans[j] += v --;
		}
		vector<int> id(m);
		iota(id.begin(), id.end(), 1);
		sort(id.begin(), id.end(), [&](int x, int y) -> bool {
			if(ans[x] == ans[y]) return x < y;
			return ans[x] > ans[y];
		});

		for(auto i : id)
			printf("%d %lld\n", i, ans[i]);

	}

	return 0;
}