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>
using namespace std;
int main(){
  int n,m[101],p[101][100],k,l[100],i,j,b,a,cnt[101],max,who,flag;
  while(1){
    max=0;
    cin >> n;
    if(n==0) break;
    for(i=1;i<=n;i++){
      cin >> m[i];
      for(j=0;j<m[i];j++){
	cin >> p[i][j];
      }
    }
    cin >> k;
    for(i=0;i<k;i++){
      cin >> l[i];
    }
    for(i=1;i<=n;i++){
      for(j=0;j<m[i];j++){
	for(b=1;b<m[i];b++){
	  if(p[i][b]<p[i][b-1]) swap(p[i][b],p[i][b-1]);
	}
      }
    }
    for(i=0;i<=k;i++){
      for(j=1;j<k;j++){
	if(l[j]<l[j-1])  swap(l[j],l[j-1]);
      }
    }
    for(i=1;i<=n;i++){
      cnt[i]=0;
      for(j=0;j<m[i];j++){
	for(a=0;a<k;a++){
	  if(l[a]==p[i][j]){
	    cnt[i]++;
	  }
	}
      }
      if(cnt[i]>max) max=cnt[i];
    }
    who=0;
    flag=0;
    for(i=1;i<=n;i++){
	if(flag==0&&cnt[i]==max){
	  who=i;
	  flag=1;
	}
	else if(flag==1&&cnt[i]==max){
	  flag=2;
	  break;
	}
      if(flag==2) break;
    }
    if(max<k) cout << -1 << endl;
    else if(flag==1) cout << who << endl;
    else if(flag==2) cout << -1 << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
int main(void){
    int n;
    while(true){
        int b;
        cin>>n;
        if(n==0)break;
vector<int> m(n);
vector<int> p,ans;
for(int i=0;i<n;i++){
    cin>>m[i];
    for(int j=0;j<m[i];j++){
int a;
cin>>a;
p.push_back(a);
    }
    
}
int k;
cin>>k;
vector<int> l(k);
for(int i=0;i<k;i++)
cin>>l[i];
int sum=0;
for(int i=0;i<n;i++){
    sum+=m[i];
    b=0;
    for(int j=0;j<k;j++){
        int t=0;
        for(int q=sum-m[i];q<sum;q++){
            if(l[j]==p[q])
            t++;
        }
        if(t==0)break;
        else b++;
    }
if(b==k) ans.push_back(i+1);
}
if(ans.size()==1){
    cout<<ans[0]<<endl;
}else{
    cout<<-1<<endl;
        
}
    }
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <bitset>
using namespace std;
int input(){int x;cin>>x;return x;}
vector<int> G[150];
int n;
int solve(vector<int> S){
  int k = S.size();
  bitset<150> s(0);
  for(int i=0;i<k;++i) s.flip(S[i]);
  int id = -1,cnt = 0;

  for(int i=0;i<n;++i){
    bitset<150> t(0);
    for(int j=0;j<G[i].size();++j) t.flip(G[i][j]);
    t&=s;
    if(t==s){
      id = i;
      ++cnt;
    }
  }
  if(cnt!=1) return -1;
  return id+1;
}

int main(){
  while(cin>>n,n){
    for(int i=0;i<n;++i){
      G[i].clear();
      int m = input();
      while(m--)
	G[i].push_back(input()-1);
    }
    vector<int> S;
    int k = input();
    for(int i=0;i<k;++i) S.push_back(input()-1);

    cout << solve(S) << endl;
  }
  return 0;
}