Problem A
A Complex Problem

Illustration of Sample 4, where dashed lines indicate subset relations ($\subseteq $) and solid lines indicate proper subset relations ($\subsetneq $)

There are many problems in the field of computer science, and some are harder than others. Computer scientists have accordingly categorized problems using complexity classes, and like to analyze these classes to see how they interact with each other.

A complexity class is a simply a set of problems; for example, the complexity class P is the set of decision problems which are solvable with an algorithm whose runtime scales as a polynomial function of the input size. We know some results about the relations between complexity classes: for example, every problem in the complexity class P also belongs to the complexity class NP of decision problems for which “yes”-instances can be verified in polynomial time. However, we don’t know if every problem in NP is also in P (and we won’t ask you to figure this out for today). Therefore, P and NP could be either one or two distinct complexity classes. On the other hand, we know that the Halting Problem is in ALL (the set of all decision problems) but not in R (the set of decision problems solvable by a Turing machine). Therefore, ALL and R are two distinct complexity classes.

Given a series of relations between complexity classes, can you find the minimum and maximum number of distinct complexity classes? Two complexity classes are distinct if and only if there is some problem that exists in one class but not in the other.

Input

Input begins with two space-separated integers $0 \leq M, N \leq 10^5$ such that $M + N > 0$. Each of the next $M$ lines consists of two distinct space-separated complexity classes $A_ i$ and $B_ i$, where a complexity class is a set of problems, denoted by one to eight uppercase or lowercase English letters. Each of these $M$ lines indicates that $A_ i \subseteq B_ i$, meaning that every problem in $A_ i$ is also in $B_ i$. Similarly, each of the next $N$ lines consists of two distinct space-separated complexity classes $A_ j$ and $B_ j$. Each of these $N$ lines indicates that $A_ j \subsetneq B_ j$, meaning that every problem in $A_ j$ is also in $B_ j$ and that at least one problem in $B_ j$ is not in $A_ j$.

There is at most one relation between any two distinct complexity classes specified in the input, and the relations between complexity classes will not imply any logical contradiction.

Output

Output two space-separated integers on a single line: the minimum and maximum number of distinct complexity classes among the specified complexity classes given in the relations in the input.

1 0
P NP

1 2

0 1
R ALL

2 2

3 0
QMIP MIPstar
MIPstar RE
RE QMIP

1 1

11 8
NC P
P BPP
P coNP
P NP
BPP BQP
coNP PSPACE
BQP PSPACE
NP PSPACE
PSPACE EXPTIME
EXPTIME NEXPTIME
NEXPTIME EXPSPACE
REG CFL
CFL NC
CFL CSL
NC PSPACE
CSL PSPACE
EXPSPACE R
R RE
RE ALL

7 16