#include<stdio.h>
int A[100][100]={0},active[100]={0},m=0;
void search(int k);
main()
{
	int n,m,i=0,j=0,k=0,flag=0;
    FILE *in,*out;
	in=fopen("collect.in","r");
	out=fopen("collect.out","w");
	fscanf(in,"%d %d",&n,&m);
	for(i=0;i<n+m;i++){
		fscanf(in,"%d",&A[i][j]);
		while(A[i][j]!=0){
			j++;
			fscanf(in,"%d",&A[i][j]);
		}
		j=0;
	}
	j=0;
	for(i=0;i<n;i++){
		j = 0;
	if(A[i][j]!=0){
	search(i);
		}
	}
	for(k=n+1;k<=n+m;k++){
		if(!active[k]){
			flag = 1;
			break;
		}
	}
	if(flag==1){
		for(k=n+1;k<=n+m;k++){
		if(!active[k])
			fprintf(out,"%d ",k);
	}
	}
	else fprintf(out,"-1");


	fprintf(out,"\n");

}
void search(int k)
{
     int j=0;
		while(A[k][j]!=0){
			if(active[A[k][j]]==1){
				j++;
				continue;
			}
			active[A[k][j]]=1;
			search(A[k][j]-1);
			j++;
		}
}