PROGRAMMING:Shoushan
Shoushan, is a person with hands around the mouth into a trumpet shape, to the distant mountains issued "Hello - Hello - Hello..." call. Through the transmission of the air, the calling sound reverberates between the deep valleys, transmits to people's ears, and sends out the conventional "signal", so as to achieve the purpose of sound communication. It turned out to be a "signal" used by Yi ancestors to call for help. Gradually, people found its practical value in life practice, and used it as a communication tool from generation to generation（ From: http://news.xrxxw.com/newsshow-8018.html ）
The cry of a mountain can be heard at the same time by nearby mountains. It is assumed that there are at most two nearby hills on each hill. Given any hill that sends out the original signal, please find out the farthest place this signal can reach.
###Input format:
Enter the first line to give three positive integers' n ','m' and 'k', where 'n' ($$Le $$10000) is the total number of hilltops (assume that each hilltop is numbered from 1 to 'n'). In the next'm 'line, two positive integers no more than' n 'are given in each line. The numbers are separated by spaces to represent the numbers of the two peaks that can be heard from each other. It is guaranteed that each pair of hilltops will only be input once, and there will be no repeated relationship input. The last line gives' k '($$Le $$10) positive integers no more than' n '. The numbers are separated by spaces to represent the number of the hill to be queried.
###Output format:
For each inquired hill in the input in turn, output the farthest Hill whose call can be chained to in a row. Note: the output must be transmitted to the inquired hilltops. If there is more than one such hill, the one with the smallest number will be output. If the cry of this mountain cannot reach any other mountain, output 0.
###Input example:
```in
7 5 4
1 2
2 3
3 1
4 5
5 6
1 4 5 7
```
###Output example:
```out
two
six
four
0
```
answer：If there is no answer, please comment
The cry of a mountain can be heard at the same time by nearby mountains. It is assumed that there are at most two nearby hills on each hill. Given any hill that sends out the original signal, please find out the farthest place this signal can reach.
###Input format:
Enter the first line to give three positive integers' n ','m' and 'k', where 'n' ($$Le $$10000) is the total number of hilltops (assume that each hilltop is numbered from 1 to 'n'). In the next'm 'line, two positive integers no more than' n 'are given in each line. The numbers are separated by spaces to represent the numbers of the two peaks that can be heard from each other. It is guaranteed that each pair of hilltops will only be input once, and there will be no repeated relationship input. The last line gives' k '($$Le $$10) positive integers no more than' n '. The numbers are separated by spaces to represent the number of the hill to be queried.
###Output format:
For each inquired hill in the input in turn, output the farthest Hill whose call can be chained to in a row. Note: the output must be transmitted to the inquired hilltops. If there is more than one such hill, the one with the smallest number will be output. If the cry of this mountain cannot reach any other mountain, output 0.
###Input example:
```in
7 5 4
1 2
2 3
3 1
4 5
5 6
1 4 5 7
```
###Output example:
```out
two
six
four
0
```
answer：If there is no answer, please comment