#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")



int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    int N, M, Q;
    scanf("%d%d%d", &N, &M, &Q);
    
    vector<Int> totals(M + 1, 0);
    
    int theme = -1;
    set<int> vis;
    int prize = -1;
    for (int q = 0; q < Q; ++q) {
      int o;
      scanf("%d", &o);
      if (o == 1) {
        int x;
        scanf("%d", &x);
        theme = x;
        vis.clear();
        prize = M;
      } else {
        int id, x;
        scanf("%d%d", &id, &x);
        if (theme != x) continue;
        if (!vis.insert(id).second) continue;
        if (o == 2) {
          totals[id] += prize--;
        }
      }
    }
    
    vector<pair<Int, int>> ans;
    for (int id = 1; id <= M; ++id) {
      ans.emplace_back(-totals[id], id);
    }
    sort(ans.begin(), ans.end());
    for (const auto &e : ans) {
      printf("%d %lld\n", e.second, -e.first);
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}