#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;
            cin >> type;
            int now , sc;
            if(type == 1)
            {
                ju = 1;
                cin >> id;
                now = id;
                sc = m;
                for(int i = 1 ; i <= m ; i++)
                {
                    if(te[i] != -1) re[i - 1].second += te[i];
                    te[i] = -1;
                }
            }
            else if(type == 2)
            {
                cin >> per >> id;
                if(te[per] == -1 && id == now && ju) te[per] = sc--;
            }
            else if(type == 3)
            {
                cin >> per >> id;
                if(id == now && te[per] == -1 && ju) te[per] = 0;
            }
            if(!q)
            {
                for(int i = 1 ; i <= m ; i++)
                {
                    if(te[i] != -1) re[i - 1].second += te[i];
                    te[i] = -1;
                }                
            }
        }
        sort(re.begin() , re.end() , cmp);
        for(int i = 0 ; i < m ; i++)
        {
            cout << re[i].first << " " << re[i].second << endl;
        }
    }
}