#include <bits/extc++.h>
#define endl '\n'
typedef long long ll;
#define int ll
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;

vector<string> splt(string s) {
  string tmp;
  vector<string> res;
  for (const auto &x : s) {
    if (x == ' ' || x == '\r' || x == '\n') {
      if (tmp.size()) {
        res.push_back(tmp);
        tmp.clear();
      }
    } else {
      tmp += x;
    }
  }
  if (tmp.size()) {
    res.push_back(tmp);
    tmp.clear();
  }
  return res;
}

void Main() {
  int n;
  cin >> n;
  vector<pair<int, int>> node;
  map<string, int> brch;
  string he, s;
  // getline(cin, s);
  cin.ignore();
  auto init = [&]() {
    node.assign(2, {-1, -1});
    brch["main"] = 1;
    he = "main";
  };
  auto commit = [&]() {
    node.push_back({brch[he], -1});
    brch[he] = node.size() - 1;
  };
  auto branch = [&](string s, int nd) {
    if (brch.find(s) != brch.end()) {
      return;
    }
    brch[s] = nd;
  };
  auto branch_dl = [&](string s) {
    if (brch.find(s) != brch.end()) {
      brch.erase(s);
    }
  };
  function<bool(int, int)> chk = [&](int dn, int up) {
    if (dn == up) {
      return 1;
    }
    if (node[dn].first >= 0 && chk(node[dn].first, up)) {
      return 1;
    }
    if (node[dn].second >= 0 && chk(node[dn].second, up)) {
      return 1;
    }
    return 0;
  };
  auto merge = [&](string s) {
    auto x = brch[s], y = brch[he];
    if (!chk(x, y) && !chk(y, x)) {
      node.push_back({x, y});
      brch[he] = node.size() - 1;
    } else if (chk(x, y)) {
      brch[he] = brch[s];
    }
  };
  auto chkout = [&](string s) { he = s; };
  auto reset = [&](int nd) { brch[he] = nd; };
  init();
  while (n--) {
    getline(cin, s);
    auto x = splt(s);
    if (x[0] == "commit") {
      commit();
    } else if (x[0] == "branch") {
      if (x[1] == "-d") {
        branch_dl(x[2]);
      } else {
        if (x.size() >= 3) {
          branch(x[1], stoll(x[2]));
        } else {
          branch(x[1], brch[he]);
        }
      }
    } else if (x[0] == "merge") {
      merge(x[1]);
    } else if (x[0] == "checkout") {
      chkout(x[1]);
    } else if (x[0] == "reset") {
      if (x.size() >= 2) {
        reset(stoll(x[1]));
      } else {
        reset(brch[he]);
      }
    }
  }
  cout << brch.size() << endl;
  for (const auto &[x, y] : brch) {
    cout << x << " " << y << endl;
  }
  cout << node.size() - 1 << endl;
  for (int i = 1; i < node.size(); ++i) {
    if (node[i].first < 0) {
      cout << 0 << endl;
    } else if (node[i].second < 0) {
      cout << 1 << " " << node[i].first << endl;
    } else {
      cout << 2 << " " << node[i].first << " " << node[i].second << endl;
    }
  }
}

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