#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
bool mem1;
#define int  long long
void solve() {
    int n , m , q;
    cin >> n >> m >> q;
    vector<array<int , 2> > pre(m + 1 , {0 , 0});
    vector<int > sore(m + 1 , 0);
    int now = 0;
    int so = m;
    while(q--)
    {
        int op , a, b;
        cin >> op ;
        if(op == 1)
        {
            cin >> a;
            now = a;
            so = m;
        }
        else if(op == 2)
        {
            cin >> a >> b;
            if(b != now) continue;
            if(pre[a][0] == b) continue;
            sore[a] += so--;
            pre[a] = {b , 2};
        }
        else
        {
            cin >> a >> b;
            pre[a] = {b , 3};
        }
    }
    vector<pair<int , int > > ans;
    for(int i = 1 ; i <= m ; i++)
        ans.push_back({-sore[i] , i});
    sort(ans.begin() , ans.end());
    for(auto [i , j] : ans)
        cout << j << " " << -i << endl;
}

bool mem2;

signed main(void) {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #ifdef LOCAL
    cerr << fixed << setprecision(2) << "Memory : " << abs(&mem1 - &mem2) / 1024. / 1024. << "MB\n";
    #endif
    int T; cin >> T;
    while (T -- ) solve();
    #ifdef LOCAL
    cerr << "Time : " << clock() * 1000 / CLOCKS_PER_SEC << "MS\n";
    #endif
    return 0;
}