A Complex Problem

There are many problems in computer science, and some are harder than others. Computer scientists group problems into complexity classes and analyze how these classes relate to each other.

A complexity class is simply a set of problems. For example, the complexity class P is the set of decision problems that can be solved by an algorithm whose running time is a polynomial function of the input size. Every problem in P also belongs to NP, the set of decision problems whose "yes" instances can be verified in polynomial time. It is not known whether every problem in NP is also in P, so P and NP could be one class or two distinct classes.

The Halting Problem is in ALL, the set of all decision problems, but it is not in R, the set of decision problems solvable by a Turing machine. So ALL and R are two distinct complexity classes.

Given a series of relations between complexity classes, find the minimum and maximum number of distinct complexity classes.

The first line contains two integers $0 \leq M, N \leq 10^5$ with $M + N > 0$, separated by a space.

Each of the next $M$ lines contains two distinct complexity classes $A_i$ and $B_i$. Each line means $A_i \subseteq B_i$, so every problem in $A_i$ is also in $B_i$.

Each of the next $N$ lines contains two distinct complexity classes $A_j$ and $B_j$. Each line means $A_j \subsetneq B_j$, so every problem in $A_j$ is also in $B_j$, and at least one problem in $B_j$ is not in $A_j$.

A complexity class is written with one to eight English letters, in uppercase or lowercase. There is at most one relation between any two distinct classes, and the relations do not contradict each other.

Print two integers separated by a space on one line: the minimum and the maximum number of distinct complexity classes that appear in the given relations.