#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=515;
string str; 
int N,Len,P,Tot=0;
set<int> Hash[MAXN];
vector<int> Med[MAXN];
int num[MAXN],seq[MAXN];
vector<vector<int> > Ans;
class FLAG
{
public:
    int Flag[MAXN];
    FLAG()
    {
        for(int i=1;i<=N;i++) Flag[i]=0;
    }
}flag;

inline void Add(int k)
{
    flag.Flag[k]=1;
    for(unsigned int i=0;i<Med[k].size();i++)
        flag.Flag[Med[k][i]]=1;
}

void dfs(int k)
{
    if(k==P+1)
    {
        vector<int> nnum; nnum.clear();
        for(int i=1;i<=N;i++) nnum.push_back(num[i]);
        Tot++; Ans.push_back(nnum);
        return;
    }
    if(k==1 && seq[k]>0)
    {
        flag.Flag[seq[k]]=1; num[k]=seq[k]; dfs(k+1); flag.Flag[seq[k]]=0; return;
    }
    if(k==1)
    {
        for(int i=1;i<=N;i++)
        {
            num[k]=i; flag.Flag[i]=1;
            dfs(k+1); flag.Flag[i]=0;
        }
        return;
    }
    if(seq[k]>0)
    {
        if(flag.Flag[seq[k]]) return;
        if(Hash[num[k-1]].find(seq[k])==Hash[num[k-1]].end()) return;
        int last=num[k-1];  FLAG Ftmp=flag; Add(last);  num[k]=seq[k];
        dfs(k+1); flag=Ftmp; return;
    }
    
    int last=num[k-1],tmp;
    for(unsigned int i=0;i<Med[last].size();i++)
    {
        tmp=Med[last][i]; if(flag.Flag[tmp]) continue;
        num[k]=tmp; FLAG Ftmp=flag; Add(last); 
        dfs(k+1); flag=Ftmp; 
    }
}

int main()
{
    freopen("doctor.in","r",stdin);
    freopen("doctor.out","w",stdout);
    scanf("%d\n",&N); int x;
    for(int i=1;i<=N;i++)
    {
        getline(cin,str);
        Len=str.length(); x=0;
        for(int j=0;j<Len;j++)
        {
            if(str[j]==' ' || str[j]==11 || str[j]==13) 
            {
                Med[i].push_back(x);
                x=0; continue;
            }
            x=x*10+str[j]-'0';
        }
        if(x!=0) Med[i].push_back(x); 
		sort(Med[i].begin(),Med[i].end());
        for(unsigned int j=0;j<Med[i].size();j++)
            Hash[i].insert(Med[i][j]);
        
    }
    scanf("%d\n",&P);
	bool start_with_all_num=1;
    for(int i=1;i<=P;i++)
	{
		scanf("%d\n",&seq[i]);
		if(seq[i]==0) start_with_all_num=0;
	}
	if(start_with_all_num==1)
	{
		printf("1\n"); 
		for(int i=1;i<=P;i++) printf("%d ",seq[i]);
		printf("\n");
		return 0;
	}
    dfs(1);
    printf("%d\n",Tot);
    for(int i=0;i<Tot;i++)
    {
        for(int j=0;j<P;j++)
            printf("%d ",Ans[i][j]);
        printf("\n");
    }
    return 0;
}