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 <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <complex>
#include <sstream>

using namespace std;

typedef long long lli;

int data[100][100];
int n;
int size[100];

main(){
  while(cin >> n && n){
    for(int i=0;i<n;i++){
      //int size;
      cin >> size[i];
      for(int j=0;j<size[i];j++){
        int in;
        cin >> in;
        //data[i].insert(in);
        data[i][j] = in;
      }
    }
    int m;
    cin >> m;
    int data2[100];
    for(int i=0;i<m;i++){
      int in;
      cin >> in;
      //data2.insert(in);
      data2[i] = in;
    }
    int ans = -1;
    for(int i=0;i<n;i++){
      bool f = true;
      for(int k=0;k<m;k++){
        for(int j=0;j<size[i];j++){
          if(data2[k] == data[i][j]){
            goto C;
          }
        }
        f = false;
        C:;
      }
      if(f){
        if(ans == -1) ans = i+1;
        else{
          ans = -1;
          goto END;
        }
      }
    }
    END:;
    cout << ans << endl;
  }
}

C++: #include <algorithm>
#include <bitset>
#include <iostream>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;

int main(void){
  int n;
  while ((cin >> n) && n) {
    vector<bitset<100> > bit(n);
    REP(i, 0, n) {
      bitset<100> sol;
      int k;
      cin >> k;
      REP(j, 0, k) {
	int t;
	cin >> t;
	t--;
	sol[t] = true;
      }
      bit[i] = sol;
    }
    int k;
    cin >> k;
    bitset<100> leakage;
    REP(i, 0, k) {
      int t;
      cin >> t;
      t--;
      leakage[t] = true;
    }
    VI cand;
    REP(i, 0, n) {
      if ((bit[i] & leakage) == leakage) {
	cand.push_back(i);
      }
    }
    if (cand.size() != 1) {
      cout << -1 << endl;
    } else {
      cout << cand[0] + 1 << endl;
    }
      
  }
}

C++: #include<iostream>
using namespace std;


int main(){
  int n;
  bool p[110][110];
  int l[110],m,t;

  while(cin >> n ,n){
    for(int i=1;i<=n;i++)
      for(int j=1;j<=n;j++)p[i][j] = false;
    for(int i=1;i<=n;i++)l[i] = false;

    for(int i=1;i<=n;i++){
      cin >> m;
      for(int j=0;j<m;j++){
	cin >> t;
	p[i][t] = true;
      }
    }

    cin >> m;
    for(int i=0;i<m;i++){
      cin >> t;
      l[t] = true;
    }

    int ans = -1;
    for(int i=1;i<=n;i++){
      bool f = true;
      for(int j=1;j<=n;j++){
	if(l[j] && !p[i][j]){
	  f = false;
	  break;
	}
      }
      if(f){
	if(ans < 0)ans = i;
	else{
	  ans = -1;
	  break;
	}
      }
    }
    cout << ans << endl;
  }
}

C++: #include<iostream>
#include<vector>
using namespace std;
bool comp[101][101];
int main(){
  int n;
  while(cin>>n,n){
    int num;
    for(int i=0;i<n;i++){
      cin>>num;
      for(int j=0;j<num;j++){
	int tmp; cin>>tmp;
	comp[i][tmp-1]=true;
      }
    }
    cin>>num;
    int list[num];
    for(int i=0;i<num;i++)cin>>list[i];
    int ans;
    int cnt=0;
    bool flag = false;
    for(int i=0;i<n;i++){
      cnt=0;
      for(int j=0;j<num;j++){
	//cout << "list["<<j<<"] = "<< list[j]-1<< endl;
	if(comp[i][list[j]-1]==false)break;
	cnt++;
      }
      if(cnt==num){
	if(flag==true){
	  flag=false;
	  break;
	}
	ans=i+1;
	flag=true;
      }
    }
    if(flag==true){
      cout << ans << endl;
    }else{
      cout << -1 << endl;
    }
  }
  return 0;
}