#include <algorithm>
#include <array>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>

using namespace std;

void solve() {
  int n, q, _;
  cin >> n >> q >> _;
  map<int, int> lhs;
  map<int, int> dp;
  while(q--) {
    char op;
    cin >> op;
    if(op == 'P') {
      int x, k;
      cin >> x >> k;
      while(k--) {
        int y;
        cin >> y;
        auto it = lhs.find(y);
        if(it != lhs.end()) dp[it->second]--;
        lhs[y] = x;
        dp[x]++;
      }
    }
    else if(op == 'Q') {
      int x;
      cin >> x;
      cout << dp[x] << "\n";
    }
    else assert(false);
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;
  cin >> t;
  while(t--) solve();
}