#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
#define mod 1000000007
#define pb push_back
typedef pair<int,int> pir;
string sstr[]={"NO\n","YES\n"};
const int N=200010;
int t,p;
int cnt=0;
int pa[N];
string name[N];
map<string,int> mp;
string s;
vector<int> g[N];
int rt;
int dep[N];
void dfs(int x)
{
    for(auto j:g[x]){
        dep[j]=dep[x]+1;
        dfs(j);
    }
}
int query()
{  
    if(mp.find(s)==mp.end()) mp[s]=++cnt,name[cnt]=s;
    return mp[s];
}
int lca(int x,int y)
{
    while(x!=y){
        if(dep[x]>dep[y]) x=pa[x];
        else if(dep[x]<dep[y]) y=pa[y];
        else x=pa[x],y=pa[y];
    }
    return x;
}
signed main()
{
	cin>>t>>p;
    for(int i=1;i<=t;i++){
        cin>>s;
        int u=query();
        int num;
        cin>>num;
        for(int j=1;j<=num;j++){
            cin>>s;
            int v=query();
            g[u].pb(v);
            pa[v]=u;
        }
    }
    for(int i=1;i<=cnt;i++) if(pa[i]==0) rt=i;
    dep[rt]=1;
    dfs(rt);
    for(int i=1;i<=p;i++){
        cin>>s;
        int u=query();
        cin>>s;
        int v=query();
        bool flag=0;
        if(dep[u]>dep[v]) swap(u,v),flag=1;
        int w=lca(u,v);
        if(u==w){
            if(dep[v]==dep[u]+1){
                cout<<name[v]<<" is the child of "<<name[u]<<'\n';
            }
            else{
                cout<<name[v]<<" is the";
                for(int j=1;j<=dep[v]-dep[u]-2;j++) cout<<" great";
                cout<<" grandchild of "<<name[u]<<'\n';
            }
        }
        else if(dep[u]==dep[v]){
            if(flag) swap(u,v);//交换过，现在还回去
            if(dep[u]-dep[w]==1) cout<<name[u]<<" and "<<name[v]<<" are siblings\n";
            else{
                int x=dep[u]-dep[w]-1;
                cout<<name[u]<<" and "<<name[v]<<" are "<<x;
                if(x%10==1&&x!=11) cout<<"st";
                else if(x%10==2&&x!=12) cout<<"nd";
                else if(x%10==3&&x!=13) cout<<"rd";
                else cout<<"th";
                cout<<" cousins\n";
            }
        }
        else{
            int x=dep[u]-dep[w]-1;
            int y=dep[v]-dep[u];
            if(flag) swap(u,v);
            cout<<name[u]<<" and "<<name[v]<<" are "<<x;
            if(x%10==1&&x!=11) cout<<"st";
            else if(x%10==2&&x!=12) cout<<"nd";
            else if(x%10==3&&x!=13) cout<<"rd";
            else cout<<"th";
            cout<<" cousins, "<<y<<" time";
            if(y>1) cout<<"s";
            cout<<" removed\n";
        }
    }
}