News

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (2500)
int cn[MX],q[MX],qp[MX];
vi g[MX];
void dj(int f){
    int b(qp[0]=0),e(1);
    CL(cn,-1),q[cn[f]=0]=f;
    while(b<e){
        int a(q[b]),w(qp[b++]);
        for(int i:g[a])
            if(!~cn[i])
                qp[e]=cn[i]=w+1,q[e++]=i;
    }
}
#define ADD(A,B) (g[A].push_back(B),g[B].push_back(A))
int C[MX],B,d;
int main(void){
    int N,a;
    while(~scanf("%d",&N)){
        F(N){IN(Q)FF(Q)scanf("%d",&a),g[i].PB(a);}
        IN(Q)F(Q){
            scanf("%d",&a);
            if(g[a].empty()){printf("0\n");continue;}
            dj(a),CL(C,B=0),d=-1;
            F(N)if(~cn[i])B=max(B,++C[cn[i]]);
            FT(1,N&&!~d)if(C[k]==B)d=k;
            printf("%d %d\n",B,d);
        }
    }
    return 0;
}