#include #include using namespace std; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(n);i++) #define rep1(i,n) for(int i=1;i<=(n);i++) #define rrep(i,n) for(int i=(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(n);i>0;i--) #define REP(i,a,b) for(int i=a;i bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const ll MOD = 1000000007; //const ll MOD = 998244353; const double pi = 3.14159265358979323846; #define Sp(p) cout<> n >> m; UnionFind uf(n); vii G(n); rep (i, m) { int u, v; cin >> u >> v; u--; v--; G[u].push_back(v); G[v].push_back(u); uf.unite(u, v); } int q; cin >> q; while (q--) { int s; cin >> s; s--; cout << uf.num[uf.find(s)] - 1 << " "; vi d(n, inf); priority_queue, greater > pq; d[s] = 0; pq.push(pii(0, s)); while (!pq.empty()) { int c = pq.top().first, u = pq.top().second; pq.pop(); for (int v: G[u]) { if (d[v] > c + 1) { d[v] = c + 1; pq.push(pii(d[v], v)); } } } int ma = -1; rep (i, n) { if (d[i] == inf) continue; chmax(ma, d[i]); } int cnt = 0; int now = 1; while (now < ma) { now *= 2; cnt++; } cout << cnt << endl; } }