#include<iostream>
#include<vector>
#include<algorithm>

struct pii
{
	long long first;
	int second;
};

pii make_pair(long long a, int b)
{
	pii x;
	x.first = a;
	x.second = b;
	return x;
}

bool operator < (pii a, pii b)
{
	if(a.first == b.first)
		return a.second < b.second;
	return a.first > b.first;
}

pii p[100007];
int n, m, q, _, now, comp;
std::vector<int>sucList, giveupList;
bool suc[100007], giveup[100007];

int main()
{
	std::cin >> _;
	while(_--)
	{
		now = 0;
		std::cin >> n >> m >> q;
		for(int i = 1; i <= m; i++)
		{
			p[i] = make_pair(0, i);
		}
		while(q--)
		{
			int op;
			std::cin >> op;
			if(op == 1)
			{
				for(int i = 0; i < sucList.size(); i++)
					suc[sucList[i]] = false;
				for(int i = 0; i < giveupList.size(); i++)
					giveup[giveupList[i]] = false;
				sucList.clear();
				giveupList.clear();
				int x;
				std::cin >> x;
				now = x;
				comp = 0;
			}
			if(op == 2)
			{
				int id, x;
				std::cin >> id >> x;
				if(x != now)
					continue;
				if(giveup[id])
					continue;
				p[id].first += m - comp;
				comp++;
				suc[id] = true;
				sucList.push_back(id);
			}
			if(op == 3)
			{
				int id, x;
				std::cin >> id >> x;
				if(x != now)
					continue;
				if(suc[id])
					continue;
				giveup[id] = true;
				giveupList.push_back(id);
				
			}
		}
		std::sort(p + 1, p + m + 1);
		for(int i = 1; i <= m; i++)
		{
			std::cout << p[i].second << ' ' << p[i].first << std::endl;
		}
		for(int i = 0; i < sucList.size(); i++)
			suc[sucList[i]] = false;
		for(int i = 0; i < giveupList.size(); i++)
			giveup[giveupList[i]] = false;
		sucList.clear();
		giveupList.clear();
	}
	return 0;
}