#include <bits/stdc++.h>

using namespace std;

struct Level {
  int players_solved = 0;
  bool started = false;
};

struct Player {
  int index;
  int points = 0;
  unordered_map<int, bool> levels_given_up;

  bool const operator<(const Player & other) {
    return (points > other.points) || (points == other.points && index < other.index);
  }
};




void solve() {
  // n = levels
  // m = player
  // q = log messages
  int n, m, q; cin >> n >> m >> q;
  struct Level levels[n+1];
  struct Player players[m+1];

  for (int i = 0; i <= m; i++)
    players[i].index = i;

  int type, id, x;
  while (q--) {
    cin >> type;
    if (type == 1) {
      cin >> x;
      levels[x].started = true;
    } else if (type == 2) {
      cin >> id >> x;
      if (levels[x].started && !players[id].levels_given_up[x]) {
        players[id].points += m - (levels[x].players_solved++);
      }
    } else if (type == 3) {
      cin >> id >> x;
      players[id].levels_given_up[x] = true;
    }
  }

  sort(players, players+m+1);

  for (int i = 0; i <= m; i++) {
    if (players[i].index != 0)
      printf("%d %d\n", players[i].index, players[i].points);
  }
}

int main() {
  int n; cin >> n;
  while (n--)
    solve();
}