Problem Statement

You are given internally vertex-disjoint $0(N+1)$ path sets $\mathcal{P} = \{P_1, \cdots, P_X\}, \mathcal{Q} = \{Q_1, \cdots, Q_Y\}$ on a directed graph with $N + 2$ vertices $0, 1, \cdots, N, N + 1$. For $1 \le i \le X$, the number of edges in $P_i$ is $K_i$, and its $j$-th vertex (counting starts from the $0$-th vertex) is $u_{i, j}$. Also, for $1 \le i \le Y$, the number of edges in $Q_i$ is $L_i$, and its $j$-th vertex (counting starts from the $0$-th vertex) is $v_{i, j}$. Here, paths of $\mathcal{P}$ and paths of $\mathcal{Q}$ are assumed to have no common edges. However, parallel edges may exist between paths of $\mathcal{P}$ and paths of $\mathcal{Q}$ (that is, for some $2$ vertices $u, v$, an edge from $u$ to $v$ may be contained in both $\mathcal{P}$ and $\mathcal{Q}$, but these are treated as distinct edges). Furthermore, all paths of $\mathcal{P}, \mathcal{Q}$ are assumed to have length at least $2$.

From these $\mathcal{P}, \mathcal{Q}$, you want to construct a path set $\mathcal{R}$ satisfying the following.

• $\mathcal{R}$ is an internally vertex-disjoint $0(N+1)$ path set.
• For each $R \in \mathcal{R}$, there exists a vertex on $R$ denoted by $u$ such that the edges of $R$ before $u$ are contained in $E(\mathcal{P})$ and the edges after $u$ are contained in $E(\mathcal{Q})$.
• For each $P \in \mathcal{P}$, the first edge of $P$ is contained in $E(\mathcal{R})$.
• For each $Q \in \mathcal{Q}$, the last edge of $Q$ is contained in $E(\mathcal{R})$.

Here, for a path set $\mathcal{X}$, $E(\mathcal{X})$ denotes the set of all edges contained in some path of $\mathcal{X}$.

Determine whether such an $\mathcal{R}$ exists, and if it exists, find the maximum possible value of $|E(\mathcal{P}) \cap E(\mathcal{R})|$.

Input

$N \ X \ Y$
$K_1$
$u_{1,0} \ u_{1,1} \ \cdots \ u_{1, K_1}$
$\vdots$
$K_X$
$u_{X,0} \ u_{X,1} \ \cdots \ u_{X, K_X}$
$L_1$
$v_{1,0} \ v_{1,1} \ \cdots \ v_{1, L_1}$
$\vdots$
$L_Y$
$v_{Y,0} \ v_{Y,1} \ \cdots \ v_{Y, L_Y}$

• All input values are integers
• $1 \le N \le 10^5$
• $1 \le X, Y \le N$
• $2 \le K_i \le N + 1$
• $u_{i,0} = 0$ and $u_{i,K_i} = N + 1$
• For $1 \le j < K_i$, $1 \le u_{i,j} \le N$
• For $1 \le j < K_i, 1 \le j' < K_{i'}$, if $i \neq i'$ or $j \neq j'$, then $u_{i,j} \neq u_{i', j'}$
• $2 \le L_i \le N + 1$
• $v_{i,0} = 0$ and $v_{i,L_i} = N + 1$
• For $1 \le j < L_i$, $1 \le v_{i,j} \le N$
• For $1 \le j < L_i, 1 \le j' < L_{i'}$, if $i \neq i'$ or $j \neq j'$, then $v_{i,j} \neq v_{i', j'}$

Output

If a path set $\mathcal{R}$ satisfying the conditions exists, output the maximum value of $|E(\mathcal{P}) \cap E(\mathcal{R})|$. Otherwise, output $-1$.

Sample

4 2 2
3
0 3 1 5
3
0 2 4 5
3
0 2 1 5
3
0 3 4 5

4

2 1 1
2
0 1 3
2
0 2 3

2

4 1 1
5
0 1 2 3 4 5
5
0 1 2 3 4 5

4

19 3 3
4
0 1 2 3 20
8
0 4 5 6 7 8 9 10 20
4
0 11 12 13 20
6
0 14 3 15 8 16 20
5
0 17 2 9 18 20
4
0 19 12 7 20

10