#include <bits/stdc++.h>
using std::vector;
using std::tuple;
#define all(x) (x).begin(), (x).end()

const int N = 400005;
int A, C, T;
vector<int> L[N], F[N], S[N], ps[N];

int tot;
vector<tuple<int, int>> es;
vector<int> adj[N];

std::map<tuple<int, int>, int> id;
vector<int> vs[N];

bool vis[N];
void solve() {
  for (int i = 1; i <= tot; i++)
    assert(adj[i].size() <= 2u);

  vector<int> ids;
  bool isRing = 0;
  int head = -1;
  auto dfs = [&](int x, int f, auto& dfs) -> void {
    ids.push_back(x);
    vis[x] = 1;
    if (adj[x].size() == 1u) head = x;
    for (auto y : adj[x]) if (y != f) {
      if (vis[y] == 1) { isRing = 1; break; }
      dfs(y, x, dfs);
    }
  };

  int ans = 0;
  for (int i = 1; i <= tot; i++) {
    if (vis[i]) continue;

    isRing = 0, head = -1;
    ids.clear();
    dfs(i, 0, dfs);
    if (head != -1 && isRing) std::reverse(ids.begin(), std::find(all(ids), head) + 1);

    vector<std::array<int, 3>> dp(ids.size());    
    auto do_trans = [&](int exclude) -> int {
      for (int j = 1; j < (int)ids.size(); j++) {
        int cur = ids[j], pre = ids[j - 1];
        for (int t = 0; t < (int)vs[cur].size(); t++)
          dp[j][t + 1] = dp[j - 1][0] + 1;
        dp[j][0] = *std::max_element(all(dp[j - 1]));
        // trivial

        for (int t = 0; t < (int)vs[cur].size(); t++)
          for (int s = 0; s < (int)vs[pre].size(); s++) {
            if (vs[cur][t] == vs[pre][s]) continue;
            dp[j][t] = std::max(dp[j][t], dp[j - 1][s] + 1);
          }
      }
      
      int cur_ans = 0;
      for (int i = 0; i < 3; i++) {
        if (i == exclude && exclude > 0) continue;
        cur_ans = std::max(cur_ans, dp.back()[i]);
      }
      return cur_ans;
    };

    if (!isRing) {
      dp.assign(ids.size(), {0, 0, 0});
      dp[0][0] = 0;
      for (int t = 0; t < (int)vs[ids[0]].size(); t++)
        dp[0][t + 1] = 1;
      ans += do_trans(0);
    } else {
      vector<int> cadi;
      for (int ex = 0; ex <= (int)vs[ids[0]].size(); ex++) {
        dp.assign(ids.size(), {0, 0, 0});
        dp[0][ex] = (ex > 0);
        cadi.push_back(do_trans(ex));
      }
      ans += *std::max_element(all(cadi));
    }
  }

  printf("%d\n", ans);
  return;
}

int main() {
  scanf("%d%d%d", &A, &C, &T);

  for (int i = 1; i <= A; i++) {
    int sz;
    scanf("%d", &sz);
    L[i].resize(sz);
    for (auto &x : L[i]) scanf("%d", &x);
  }

  for (int i = 1; i <= A; i++) {
    int sz;
    scanf("%d", &sz);
    F[i].resize(sz);
    for (auto &x : F[i]) scanf("%d", &x);
  }

  for (int i = 1; i <= C; i++) {
    int sz;
    scanf("%d", &sz);
    S[i].resize(sz);
    for (auto &x : S[i]) {
      scanf("%d", &x);
      ++tot;
      ps[x].push_back(tot);
      id[{i, x}] = tot;
    }

    if (sz == 2)
      es.emplace_back(tot - 1, tot);
  }

  for (int i = 1; i <= T; i++)
    if ((int)ps[i].size() == 2)
      es.emplace_back(ps[i][0], ps[i][1]);
  for (int i = 1; i <= A; i++)
    for (auto l : L[i]) for (auto f : F[i])
      vs[id[{l, f}]].push_back(i);
  
  for (auto &[a, b] : es)
    if (a > b) std::swap(a, b);
  
  std::sort(all(es));
  es.erase(std::unique(all(es)), es.end());
  for (auto [a, b] : es) {
    adj[a].push_back(b);
    adj[b].push_back(a);
  }

  solve();
  return 0;
}