#include <bits/stdc++.h>

#define ll long long
#define mod 1000000007

using namespace std;

ll point[100005];
bool cmp(pair<int , int> a, pair<int , int> b){
    if(a.first == b.first){
        return a.second < b.second;
    }
    return a.first > b.first;
}
void solve(){
    int n,m , q;
    cin >> n >> m >> q;
    vector<int> cur;
    set<int> st;
    int round = 0;
    for(int i = 1; i <=m ; i++){
        point[i] = 0;
    }
    for(int i =1; i <= q; i++){
        int type;
        cin >> type;
        if(type == 1){
            int x;
            cin >> x;
            round = x;
            st.clear();
            cur.clear();
        }
        else if(type == 2){
            int id;
            int val;
            cin >>id>> val;
            if(val != round){
                continue;
            }
            else{
                auto find = st.find(id);
                if(find == st.end()){
                    st.insert(id);
                    
                    point[id] += m - cur.size();
                    cur.push_back(id);
                }

            }
            

        }
        else{
            int id;
            int val;
            cin >>id>> val;
            st.insert(id);
        }
    }
    vector<pair<int , int>> ans;
    for(int i = 1; i <= m; i++){
        ans.push_back({point[i], i});
    }
    sort(ans.begin(), ans.end(), cmp);
    for(int i = 0; i < ans.size(); i++){
        cout << ans[i].second << " " <<ans[i].first << endl;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin >> t;
    while(t--){
        solve();
    }

    return 0;
}