#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <climits>
#include <iostream>
#include <algorithm>
using namespace std;
#define il inline
#define rr read()
#define wr puts()
#define bl putchar(' ')
#define in int
#define max(x, y) (x > y ? x : y)
#define min(x, y) (x < y ? x : y)
#define rep(i, l, n) for (in i = l; i >= n; i--)
#define int long long
il int read()
{
    char ch;
    bool f = 0;
    while ((ch = getchar()) < '0' || ch > '9')
        (ch == '-') && (f = 1);
    in x = ch ^ '0';
    while ((ch = getchar()) <= '9' && ch >= '0')
        x = (x << 1) + (x << 3) + (ch ^ '0');
    return f ? -x : x;
}

il void print(in x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x >= 10)
        print(x / 10);
    putchar(x % 10 ^ '0');
}

const int MAXN = 4e6 + 100;

struct node
{
    int index, point;
};

bool cmp(node a, node b)
{
    if (a.point != b.point)
        return a.point > b.point;
    else
        return a.index < b.index;
}

void solve()
{
    int n, m, q;
    cin >> n >> m >> q;
    vector<node> participant(m);
    vector<int> vis(m);
    int temp = 0;
    queue<int> complete;
    for (int i = 0; i < m; ++i)
        participant[i].index = i + 1;
    while (q--)
    {
        int op;
        cin >> op;
        if (op == 1)
        {
            int mp;
            cin >> mp;
            temp = mp;
            for (int i = 0; i < m; ++i)
                vis[i] = 0;
            while (!complete.empty())
                complete.pop();
            continue;
        }
        int id, x;
        cin >> id >> x;
        id--;
        if (op == 3)
        {
            vis[id] = -1;
        }
        if (op == 2)
        {
            if (x != temp)
                continue;
            if (vis[id] != 0)
                continue;
            vis[id] = 1;
            complete.emplace(id);
            participant[id].point += m - complete.size() + 1;
        }
    }
    sort(participant.begin(), participant.end(), cmp);
    for (int i = 0; i < m; ++i)
    {
        cout << participant[i].index << " " << participant[i].point << "\n";
    }
    return;
}

signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}