시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2.5 초 512 MB 0 0 0 0.000%

## 문제

Consider a country with $n$ towns. The towns are connected by $m$ roads, all with the same length. (See Figure 2 for an example.)

This country has $k$ citizens. Interestingly, the home and office of the $i$th citizen are located in different towns $A_i$ and $B_i$, respectively. Hence, every day, the $i$th citizen moves back and forth between two fixed towns $A_i$ and $B_i$ (since the $i$th citizen needs to work).

To save time, the $i$th citizen will choose a path with the shortest length. If there are several shortest paths between $A_i$ and $B_i$, the $i$th citizen chooses by random one shortest path which Donald does not know. The expected chance that the $i$th citizen passing through town w equals

$E_i(w) = \frac{\text{Number of shortest paths between }A_i\text{ and }B_i\text{ passing through town }w}{\text{Number of shortest paths between }A_i\text{ and }B_i}$

Donald is the president of the country and he wants to understand the needs of his citizens. He wants to setup a meeting office in a town so that he can meet as many citizens as possible. Precisely, he aims to setup the meeting office in a town $w$ that maximizes $\sum_{i=0}^{k-1}{E_i(w)}$.

Your task is to help Donald identify the town $w$. When there are multiple towns $w$ that maximize $\sum_{i=0}^{k-1}{E_i(w)}$, report any one of them. In addition, due to certain geological constraints during the construction of the towns and roads, it is found that the number of shortest paths between any two towns will not exceed $2^{15}$. Note that double-precision floating-point is required for this problem.

Example 1: Suppose $k = 1$ where $(A_0, B_0) = (4, 10)$. Then, there is exactly one shortest path of length $2$, which is $(4, 7, 10)$. Donald can build the meeting office in either town $4$, town $7$, or town $10$.

Example 2: Suppose $k = 2$ where $(A_0, B_0) = (4, 10)$ and $(A_1, B_1) = (3, 8)$. Then, there is exactly one shortest path between town $4$ and town $10$ of length $2$, which is $(4, 7, 10)$. Also, there is exactly one shortest path between town $3$ and town $8$ of length $3$, which is $(3, 7, 11, 8)$. If Donald builds the meeting office in town $7$, the expected number of citizens passing through town $7$ is $2$.

Example 3: Suppose $k = 2$ where $(A_0, B_0) = (1, 13)$ and $(A_1, B_1) = (6, 2)$. Then, we have: (1) $10$ shortest paths of lenght $4$ between town $1$ and town $13$. (2) 3 shotest paths of lenght $3$ between town $6$ and town $2$. If Donald builds the meeting office in town $7$, we have: (1) For the 0th citizen, $9$ shortest paths between town $1$ and town $13$ passing through town $7. (2) For the 1st citizen,$2$shortest paths between town 6 and$town $2$ passing through town $7$. Then, the expected number of citizens passing through town 7 is $E_0(7) + E_1(7) = 9/10 + 2/3 = 1.567$. In fact, this is the best solution. Donald needs to build the meeting office in town $7$.

## 입력

The input will start with two integers $n$ and $m$ in a single line. $n$ denotes the number of towns while $m$ denotes the number of edges. Then, the next $m$ lines are the roads, each consisting of two integers representing the two towns connected by the road.

Afterwards, the next line contains an integer $k$, which denotes the number of citizens. It is followed by $k$ lines. The $i$th line stores two integers $A_i$ and $B_i$, for $i = 0, . . . , k - 1$.

## 출력

Output a single line with exactly one integer, representing the town $w$ that maximises $\sum_{i=0}^{k-1}{E_i(w)}$. When there are multiple possible towns, output any one of them.

• n ≤ 5000
• m ≤ 40000
• k ≤ 2000

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

2

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

2

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

3

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

7