Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()

	for {
		N := io.NextInt()
		if N == 0 {
			break
		}
		set := make([]map[int]struct{}, N)
		for i := 0; i < N; i++ {
			set[i] = make(map[int]struct{})
			M := io.NextInt()
			for j := 0; j < M; j++ {
				p := io.NextInt()
				set[i][p] = struct{}{}
			}
		}
		K := io.NextInt()
		l := make([]int, K)
		for i := 0; i < K; i++ {
			l[i] = io.NextInt()
		}

		ans := 0
	FOR_OUTER:
		for i := 0; i < N; i++ {
			for j := 0; j < K; j++ {
				if _, f := set[i][l[j]]; f == false {
					continue FOR_OUTER
				}
			}
			switch ans {
			case 0:
				ans = i + 1
			default:
				ans = -1
			}
		}
		if ans > 0 {
			io.Println(ans)
		} else {
			io.Println(-1)
		}
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <stdio.h>
#include <string.h>

int main(void){
	int member[100][100], leak[100], n, m, i, j, x, count, res;
	scanf("%d",&n);
	while(n){
		memset(member,0,sizeof(member));
		for(i = 0;i < n;i++){
			scanf("%d",&m);
			for(j = 0;j < m;j++){
				scanf("%d",&x);
				member[i][x - 1] = 1;
			}
		}
		scanf("%d",&m);
		memset(leak,0,sizeof(leak));
		for(i = 0;i < m;i++){
			scanf("%d",&x);
			leak[x - 1] = 1;
		}
		count = 0;
		for(i = 0;i < n;i++){
			for(j = 0;j < n;j++)
				if(leak[j] && !member[i][j]) break;
			if(j == n){
				count++;
				res = i + 1;
			}
		}
		if(count == 1)
			printf("%d\n",res);
		else
			printf("-1\n");
		scanf("%d",&n);
	}
	return 0;
}

C++: //18
#include<iostream>
#include<algorithm>

using namespace std;

int main(){
  for(int n;cin>>n,n;){
    bool kn[100][101]={{}};
    for(int i=0;i<n;i++){
      int m;
      cin>>m;
      while(m--){
	int p;
	cin>>p;
	kn[i][p]=true;
      }
    }
    int k;
    cin>>k;
    bool pr[100];
    fill(pr,pr+100,true);
    while(k--){
      int l;
      cin>>l;
      for(int i=0;i<n;i++){
	if(!kn[i][l]){
	  pr[i]=false;
	}
      }
    }
    cout<<((count(pr,pr+n,true)!=1)?-1:find(pr,pr+n,true)-pr+1)<<endl;
  }
  return 0;
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>

using namespace std;

struct Info{
	Info(){
		for(int i = 1; i <= 100; i++)knowTable[i] = false;
	}
	bool knowTable[101];
};

void func(int N){

	Info info[N+1];
	int num,tmp;

	for(int i = 1; i <= N; i++){
		scanf("%d",&num);

		for(int loop = 0; loop < num; loop++){
			scanf("%d",&tmp);
			info[i].knowTable[tmp] = true;
		}
	}

	int leakTable[N],index = 0;
	scanf("%d",&num);
	for(int i = 0; i < num; i++){
		scanf("%d",&tmp);
		leakTable[index++] = tmp;
	}

	int count = 0,ans;
	bool FLG;

	for(int i = 1; i <= N; i++){
		FLG = true;
		for(int k = 0; k < index; k++){
			if(info[i].knowTable[leakTable[k]] == false){
				FLG = false;
				break;
			}
		}
		if(FLG){
			count++;
			ans = i;
		}
	}

	if(count == 1){
		printf("%d\n",ans);
	}else{
		printf("-1\n");
	}

}

int main(){

	int N;

	while(true){
		scanf("%d",&N);
		if(N == 0)break;

		func(N);
	}

	return 0;
}