1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll
using PII = pair<int, int>;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<V<T>>;
template <typename T> using VVV = vector<VV<T>>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back

const ll INF = (1LL<<60);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')';
  return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'[';
  REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}
  out<<']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, m, q;
  cin >> n >> m >> q;
  V<int> u(m), v(m), r(q);
  REP(i, m) cin >> u[i] >> v[i], u[i]--, v[i]--;
  REP(i, q) cin >> r[i], r[i]--;

  // 最短路DAGの構築
  VV<int> g1(n);
  REP(i, m) {
    g1[u[i]].PB(v[i]);
    g1[v[i]].PB(u[i]);
  }

  V<int> d(n, INF);
  d[0] = 0;
  priority_queue<PII, V<PII>, greater<PII>> que;
  que.push({d[0], 0});

  while(que.size()) {
    PII p = que.top(); que.pop();
    if(d[p.second] < p.first) continue;
    for(auto i: g1[p.second]) {
      if(d[i] > d[p.second] + 1) {
        d[i] = d[p.second] + 1;
        que.push({d[i], i});
      }
    }
  }

  V<int> h(n);
  VV<int> g(n);
  REP(i, m) {
    int x = u[i], y = v[i];
    if(d[x] > d[y]) swap(x, y);
    if(d[x] + 1 == d[y]) {
      g[x].PB(y);
      h[y]++;
    }
  }

  map<PII, int> mp;
  int ret = 0;
  REP(i, q) {
    int x = u[r[i]], y = v[r[i]];
    if(d[x] > d[y]) swap(x, y);
    // cout << "x=" << x << " y=" << y << endl;
    if(d[y] - d[x] != 1 || mp.find({x, y}) != mp.end()) {
      cout << ret << endl;
      continue;
    }
    stack<int> st;
    h[y]--;
    if(h[y] == 0) {
      st.push(y);
      ret++;
    }
    mp[{x, y}] = 1;

    while(st.size()) {
      int t = st.top(); st.pop();
      // 頂点tから出る辺を消す
      for(auto j: g[t]) {
        if(mp.find({t, j}) != mp.end()) continue;
        mp[{t, j}] = 1;
        h[j]--; 
        if(h[j] == 0) {
          st.push(j);
          ret++;
        }
      }
    }

    cout << ret << endl;
  }

  return 0;
}