It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other highways to keep the rest of the cities connected. Given the map of cities which have all the remaining highways marked, you are supposed to tell the number of highways need to be repaired, quickly.

For example, if we have 3 cities and 2 highways connecting city₁-city₂ and city₁-city₃. Then if city₁ is occupied by the enemy, we must have 1 highway repaired, that is the highway city₂-city₃.

Input

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.

Output

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

Sample Input

3 2 3

1 2

1 3

1 2 3

Sample Output

1

0

0

分析：
（1）题目给出一张图，以及几条边。要求当去掉其中的一个顶点后为了使剩下的顶点可以连通需要增加多少条边。
（2）其实只要考虑去掉这个顶点后，剩余的顶点可以组成几个独立的区域，假设该区域数为t，则需要增加的边即为t-1。
（3）为了实现（2）中所说，我们采用DFS（深度优先）最佳。

#include <iostream>
#include <string>
#include <vector>
#include <string.h>
#include <algorithm>
using namespace std;
#define max 1001

int visited[max];
int a[max][max];
int n,m,k;
void dfs(int t)
{
visited[t] = 1;
int i;
for(i=1;i<=n;i++)
{
if(!visited[i]&&a[i][t] == 1)
dfs(i);
}

}
int main()
{
memset(a,0,sizeof(a));

cin >> n >> m >> k;
int x,y;
for(int i=0;i<m;i++)
{
cin >> x >> y;
a[x][y]= 1;
a[y][x]= 1;
}

int temp,num;
for(int i=0;i<k;i++)
{
num = 0;
cin >> temp;
memset(visited,0,sizeof(visited));
visited[temp] = 1;
for(int j=1;j<=n;j++)
{
if(visited[j] == 0)
{
dfs(j);
num++;
}
}
cout<<num-1<<endl;
}
return 0;
}