#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long

using namespace std;

int read()
{
    int a = 0,x = 1;char ch = getchar();
    while(ch > '9' || ch < '0') {if(ch == '-') x = -1;ch = getchar();}
    while(ch >= '0' && ch <= '9') {a = a*10 + ch-'0';ch = getchar();}
    return a*x;
}

const int N=1e6+7;

int n,m,q,man;
int ans[N],vis[N],ID[N],ins[N];
bool cmp(int a,int b)
{
    if(ans[a] != ans[b]) return ans[a] > ans[b];
    return a < b;
} 
void solve()
{
    n = read(),m = read(),q = read();
    for(int i = 1;i <= n;i ++) vis[i] = 0;
    for(int i = 1;i <= m;i ++) ans[i] = 0,ID[i] = i,ins[i] = 0;
    int flag = 0;
    for(int i = 1;i <= q;i ++) {
        int op = read();
        if(op == 1) {
            int x = read();
            if(vis[x]) continue;
            flag = x;man = m;
        } else if(op == 2) {
            int id = read(),x = read();
            if(x != flag || ins[id] == flag) continue;
            ins[id] = flag;ans[id] += man;man --;
        } else if(op == 3) {
            int id = read(),x = read();
            if(x != flag || ins[id] == flag) continue;
            ins[id] = flag;
        }
    }
    sort(ID+1,ID+m+1,cmp);
    for(int i = 1;i <= m;i ++) printf("%d %d\n",ID[i],ans[ID[i]]);
}

int main()
{
    // freopen("in.in","r",stdin);freopen("out.out","w",stdout);
    int T = read();
    while(T --) solve();
}