9703: ABC190 —— C - Bowls and Dishes
[Creator : ]
Description
We have $N$ dishes numbered $1, 2, \dots, N$ and $M$ conditions numbered $1, 2, \dots, M$.
Condition $i$ is satisfied when both Dish $A_i$ and Dish $B_i$ have (one or more) balls on them.
There are $K$ people numbered $1, 2, \dots, K$. Person $i$ will put a ball on Dish $C_i$ or Dish $D_i$.
At most how many conditions will be satisfied?
Condition $i$ is satisfied when both Dish $A_i$ and Dish $B_i$ have (one or more) balls on them.
There are $K$ people numbered $1, 2, \dots, K$. Person $i$ will put a ball on Dish $C_i$ or Dish $D_i$.
At most how many conditions will be satisfied?
Input
Input is given from Standard Input in the following format:
```
$N$ $M$
$A_1$ $B_1$
$\vdots$
$A_M$ $B_M$
$K$
$C_1$ $D_1$
$\vdots$
$C_K$ $D_K$
```
```
$N$ $M$
$A_1$ $B_1$
$\vdots$
$A_M$ $B_M$
$K$
$C_1$ $D_1$
$\vdots$
$C_K$ $D_K$
```
Output
Print the answer.
Constraints
- All values in input are integers.
- $2 ≤ N ≤ 100$
- $1 ≤ M ≤ 100$
- $1 ≤ A_i < B_i ≤ N$
- $1 ≤ K ≤ 16$
- $1 ≤ C_i < D_i ≤ N$
- $2 ≤ N ≤ 100$
- $1 ≤ M ≤ 100$
- $1 ≤ A_i < B_i ≤ N$
- $1 ≤ K ≤ 16$
- $1 ≤ C_i < D_i ≤ N$
Sample 1 Input
4 4
1 2
1 3
2 4
3 4
3
1 2
1 3
2 3
Sample 1 Output
2
For example, if People 1,2,3 put their balls on Dishes 1,3,2, respectively, Conditions 1 and 2 will be satisfied.
Sample 2 Input
4 4
1 2
1 3
2 4
3 4
4
3 4
1 2
2 4
2 4
Sample 2 Output
4
For example, if People 1,2,3,4 put their balls on Dishes 3,1,2,4, respectively, all conditions will be satisfied.
Sample 3 Input
6 12
2 3
4 6
1 2
4 5
2 6
1 5
4 5
1 3
1 2
2 6
2 3
2 5
5
3 5
1 4
2 6
4 6
5 6
Sample 3 Output
9