#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <stack>
#include <deque>
using namespace std;
bool cmp(pair<int , long> a , pair<int , long> b)
{
    if(a.second == b.second) return a.first < b.first;
    return a.second > b.second;
}
int main()
{
    cin.tie(0),cout.sync_with_stdio(0);
    int t;
    cin >> t;
    while(t--)
    {
        int n , m , q;
        cin >> n >> m >> q;
        vector<pair<int , long long>> re(m);
        for(int i = 0 ; i < m ; i++) re[i].first = i + 1;
        vector<long long> te(m + 1 , -1);
        int ju = 0;
        while(q--)
        {
            int type , id , per;
            if(!ju) cin >> type;
            int now , sc;
            if(type == 1 || ju)
            {
                ju = 1;
                cin >> id;
                now = id;
                sc = m;
                int ju2 = 1;
                vector<int> s(m + 1 , 0);
                while(ju2 && q)
                {
                    q--;
                    cin >> type;
                    if(type == 1)
                    {
                        q++;
                        ju2 = 0;
                    }
                    else if(type == 2)
                    {
                        cin >> per >> id;
                        if(s[per] == 0 && id == now) {re[per - 1].second += sc--; s[per] = 1;}
                    }
                    else 
                    {
                        cin >> per >> id;
                        if(s[per] == 0 && id == now) {s[per] = -1;}
                    }
                }
            }
        }
        sort(re.begin() , re.end() , cmp);
        for(int i = 0 ; i < m ; i++)
        {
            cout << re[i].first << " " << re[i].second << endl;
        }
    }
}