#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<vector>

 #include<set>

 using namespace std;

 vector<int>ans;

 const int N=+;

 const int M=;

 const int INF=0xffffffff;

 struct Edge{

     int to,next;

 } edge[M];

 int  n,m,temp,cnt,dep,top,atype;

 int  dfn[N],low[N],vis[N],head[N],st[N],belong[N],in[N],out[N],sum[N];

 //sum[i]记录第i个连通图的点的个数,in[i],out[i],表示缩点之后点的入度和初度。

 void init(){

       cnt=dep=top=atype=;

     memset(head,-,sizeof(head));

     memset(dfn,,sizeof(dfn));

     memset(low,,sizeof(low));

     memset(vis,,sizeof(vis));

     memset(belong,,sizeof(belong));

     memset(in,,sizeof(in));

     memset(out,,sizeof(out));

     memset(sum,,sizeof(sum));

 }

 void addedge(int u,int v){

     edge[cnt].to=v;

     edge[cnt].next=head[u];

     head[u]=cnt++;

 }

 void Tarjan(int u){

     dfn[u]=low[u]=++dep;

     st[top++]=u;

     vis[u]=;

     for(int i=head[u]; i!=-; i=edge[i].next){

         int v=edge[i].to;

         if(!dfn[v]){

             Tarjan(v);

             low[u]=min(low[u],low[v]);

         }

         else if(vis[v]){

             low[u]=min(low[u],dfn[v]);

         }

     }

     int j;

     if(dfn[u]==low[u]){

         atype++;

         do{

             j=st[--top];

             belong[j]=atype;

             sum[atype]++;   //记录每个连通分量中点的个数

             vis[j]=;

         }

         while(u!=j);

     }

 }

 int main(){

      while(~scanf("%d",&n)){

         init();

         for(int i=;i<=n;i++){

             scanf("%d",&m);

             for(int j=;j<=m;j++){

                 scanf("%d",&temp);

                 addedge(i,temp+n);

             }

         }

         for(int i=;i<=n;i++){

             scanf("%d",&temp);

             addedge(temp+n,i);

         }

         for(int i=;i<=*n;i++)

             if(!dfn[i])

             Tarjan(i);

         for(int i=;i<=n;i++){

             ans.clear();

             for(int j=head[i];j!=-;j=edge[j].next){

                 int v=edge[j].to;

             if(belong[i]==belong[v])

                 ans.push_back(v-n);

             }

             int sz=ans.size();

             sort(ans.begin(),ans.end());

             printf("%d",sz);

             for(int j=;j<sz;j++){

                 printf(" %d",ans[j]);

             }

             puts("");

         }

      }

 }