#include <vector>#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int N = 1e4 + 5;vector<int> g[N];bool vis[N];int sg[N];void dfs(int u){ vis[u] = true; vector<int> num; for(int i=0;i<(int)g[u].size();i++) { int v = g[u][i]; if(!vis[v]) dfs(v); num.push_back(sg[v]); } sort(num.begin(),num.end()); int n = unique(num.begin(),num.end()) - num.begin(); sg[u] = 0; for(int i=0;i<n;i++) { if(sg[u] == num[i]) sg[u]++; else break; }}int main(){ int n, ncase = 0; while(~scanf("%d",&n)) { memset(vis,false,sizeof(vis)); for(int u=1;u<n;u++) { g[u].clear(); int num, v; scanf("%d",&num); while(num--) { scanf("%d",&v); g[u].push_back(v); } } g[n].clear(); for(int i=1;i<=n;i++) if(!vis[i]) dfs(i); int Q; scanf("%d",&Q); printf("Case %d:n",++ncase); while(Q--) { int num, i, ans = 0; scanf("%d",&num); while(num--) { scanf("%d",&i); ans ^= sg[i]; } puts(ans?"Alice":"Bob"); } } return 0;}
