#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={0,-1,0,1,1,1,-1,-1,0}; const ll dx[9]={-1,0,1,0,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ ll n,m;cin >> n >> m; vvl g(n); rep(i,m){ ll a,b;cin >> a >> b;a--;b--; g[a].emplace_back(b); g[b].emplace_back(a); } ll q;cin >> q; while(q--){ ll a;cin >> a;a--; vl dp(n,-1);dp[a]=0; queue que;que.push(a); while(que.size()){ ll v=que.front();que.pop(); for(auto p:g[v]){ if(dp[p]!=-1)continue; dp[p]=dp[v]+1; que.push(p); } } ll cnt=0; ll res=0; rep(i,n){ if(dp[i]!=-1)cnt++; chmax(res,dp[i]); } ll p=0; while(1){ if((1<=res)break; p++; } cout << cnt-1 <<" " << p << endl; } }