import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt + 1;
      int[2] X;
      X[0] = readInt;
      X[1] = readInt;
      int[][2] K;
      int[][][2] U;
      static foreach (h; 0 .. 2) {
        K[h] = new int[X[h]];
        U[h] = new int[][X[h]];
        foreach (x; 0 .. X[h]) {
          K[h][x] = readInt;
          U[h][x] = new int[K[h][x] + 1];
          foreach (k; 0 .. K[h][x] + 1) {
            U[h][x][k] = readInt;
          }
        }
      }
      
      alias XK = Tuple!(int, "x", int, "k");
      XK[][2] pos;
      static foreach (h; 0 .. 2) {
        pos[h] = new XK[N + 1];
        pos[h][] = XK(-1, -1);
        foreach (x; 0 .. X[h]) {
          foreach (k; 1 .. K[h][x]) {
            pos[h][U[h][x][k]] = XK(x, k);
          }
        }
      }
      
      auto del = new bool[][X[0]];
      foreach (x; 0 .. X[0]) {
        del[x] = new bool[K[0][x]];
      }
      
      auto head = new bool[N + 1];
      DList!int que;
      void update(int u) {
        debug {
          writeln("    update ", u);
        }
        if (!~pos[1][u].x) {
          return;
        }
        if (head[u]) {
          head[u] = false;
          for (; ; ) {
            debug {
              writeln("      u = ", u);
            }
            if (u == 0) {
              break;
            }
            const y = pos[0][u].x;
            const l = pos[0][u].k;
            if (~y && !del[y][l - 1]) {
              head[u] = true;
              que ~= u;
              break;
            }
            const z = pos[1][u].x;
            const m = pos[1][u].k;
            u = U[1][z][m - 1];
          }
        }
      }
      foreach (x; 0 .. X[1]) {
        const u = U[1][x][K[1][x] - 1];
        head[u] = true;
        update(u);
      }
      for (; !que.empty; ) {
        const u = que.front;
        que.removeFront;
        if (!head[u]) {
          continue;
        }
        debug {
          writeln("need ", u);
        }
        const x = pos[0][u].x;
        foreach (k; pos[0][u].k .. K[0][x]) {
          if (del[x][k]) {
            break;
          }
          debug {
            writeln("  del ", x, " ", k);
          }
          del[x][k] = true;
          update(U[0][x][k + 1]);
        }
      }
      
      int ans;
      foreach (x; 0 .. X[0]) {
        foreach (k; 0 .. K[0][x]) {
          if (!del[x][k]) {
            ++ans;
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}