1 #include <stdio.h>
  2 #include <cstring>
  3 #include <algorithm>
  4 using namespace std;
  5 const int INF = 0x1f1f1f1f;
  6 #define clr(x) memset(x, 0, sizeof(x))
  7 const int MAXN = 2010*3;
  8
  9 struct Edge
 10 {
 11     int to;
 12     int next;
 13 }edge[10000010];
 14 int head[MAXN];
 15 int tot;
 16
 17 void add(int s, int u)
 18 {
 19     edge[tot].to = u;
 20     edge[tot].next = head[s];
 21     head[s] = tot++;
 22 }
 23
 24 int dfn[MAXN], low[MAXN];
 25 int ins[MAXN], sta[MAXN], col[MAXN];
 26 int ti, top, cnt;
 27 int n;
 28
 29 void tarjan(int u)
 30 {
 31     int i, k;
 32     dfn[u] = low[u] = ++ti;
 33     ins[u] = 1;
 34     sta[++top] = u;
 35     for(i = head[u]; i != -1; i = edge[i].next) {
 36         k = edge[i].to;
 37         if(dfn[k] == 0) {
 38             tarjan(k);
 39             low[u] = min(low[u], low[k]);
 40         } else if(ins[k]) {
 41             low[u] = min(low[u], dfn[k]);
 42         }
 43     }
 44     if(dfn[u] == low[u]) {
 45         cnt++;
 46         do
 47         {
 48             k = sta[top--];
 49             col[k] = cnt;
 50             ins[k] = 0;
 51         }while(u != k);
 52     }
 53
 54 }
 55
 56 void solve()
 57 {
 58     int i, k;
 59     ti = top = cnt = 0;
 60     clr(dfn);
 61     for(i = 1; i <= n; ++i)
 62         if(!dfn[i])
 63             tarjan(i);
 64 }
 65
 66 int main()
 67 {
 68     int i, j, k;
 69     int a, m;
 70     int mar;
 71     int ans[MAXN];
 72     while(scanf("%d", &n) != EOF)
 73     {
 74         tot = 0;
 75         memset(head, 0xff, sizeof(head));
 76
 77         for(i = 1; i <= n; ++i) {
 78             scanf("%d", &m);
 79             while(m--) {
 80                 scanf("%d", &a);
 81                 add(i, a+n);
 82             }
 83         }
 84         for(i = 1; i <= n; ++i) {
 85             scanf("%d", &mar);
 86             add(mar+n, i);
 87         }
 88
 89         solve();
 90
 91         int tmp;
 92         for(i = 1; i <= n; ++i) {
 93             tmp = 0;
 94             for(j = head[i]; j != -1; j = edge[j].next) {
 95                 k = edge[j].to;
 96                 if(col[i] == col[k])
 97                     ans[tmp++] = k;
 98             }
 99             sort(ans, ans+tmp);
100             printf("%d", tmp);
101             for(j = 0; j < tmp; ++j)
102                 printf(" %d", ans[j]-n);
103             puts("");
104         }
105     }
106     return 0;
107 }