1 #include<algorithm>
 2 #include<iostream>
 3 #include<cstring>
 4 #include<cstdlib>
 5 #include<cstdio>
 6 #include<cmath>
 7 using namespace std;
 8 const int ma = 500001;
 9 int num, be[ma], fat[ma];
10 char c;
11 int x;
12 inline int Get(int &x)
13 {
14     x = 0;
15     while((c = getchar()) < '0' || c > '9');
16     while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
17     return x;
18 }
19 int tot, go[ma], next[ma], first[ma];
20 void Ins(int x, int y)
21 {
22     next[++tot] = first[x];
23     first[x] = tot;
24     go[tot] = y;
25     next[++tot] = first[y];
26     first[y] = tot;
27     go[tot] = x;
28 }
29 int Find(int x)
30 {
31     return (x != fat[x]) ? fat[x] = Find(fat[x]) : x;
32 }
33 int v, fa, mo;
34 int Un(int u)
35 {
36     ++num;
37     fa = Find(u);
38     for(int i = first[u]; i; i = next[i])
39     {
40         v = go[i];
41         if(be[v])
42         {
43             mo = Find(v);
44             if(fa != mo)
45             {
46                 fat[mo] = fa;
47                 --num;
48             }
49         }
50     }
51     return num;
52 }
53 bool vis[ma];
54 int n, m, k, del[ma], ans[ma];
55 int main()
56 {
57     Get(n), Get(m);
58     for(int i = 0; i < n; ++i) fat[i] = i;
59     for(int i = 0; i < m; ++i) Ins(Get(x), Get(x));
60     Get(k);
61     for(int i = 0; i < k; ++i) vis[Get(del[i])] = true;
62     for(int i = 0; i < n; ++i)
63         if(!vis[i])
64         {
65             Un(i);
66             be[i] = true;
67         }
68     ans[k] = num;
69     for(int i = k - 1; i >= 0; --i)
70     {
71         ans[i] = Un(del[i]);
72         be[del[i]] = true;
73     }
74     for(int i = 0; i <= k; ++i) printf("%d\n", ans[i]);=
75 }