Battle Over Cities

Each input file contains one test case. Each case starts with a line containing 3 numbers $N$ ($< 1000$), $M$ and $K$, which are the total number of cities, the number of remaining highways, and the number of cities to be checked, respectively. Then $M$ lines follow, each describes a highway by 2 integers, which are the numbers of the cities the highway connects. The cities are numbered from 1 to $N$. Finally there is a line containing $K$ numbers, which represent the cities we concern.

For each of the $K$ cities, output in a line the number of highways need to be repaired if that city is lost.