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 <vector>
using namespace std;

int main(void){
  while(true){
    int n;
    cin >> n;
    if(n == 0){ break; }

    int m, p;
    vector<vector<bool> > privacy(n, vector<bool>(n + 1, false));
    for(int i = 0; i < n; i++){
      cin >> m;
      for(int j = 0; j < m; j++){
        cin >> p;
        privacy[i][p] = true;
      }
    }

    int k;
    cin >> k;
    vector<int> l(k);
    for(int i = 0; i < k; i++){
      cin >> l[i];
    }

    int ans = 0;
    for(int i = 0; i < n; i++){
      bool flag = true;
      for(int j = 0; flag && j < k; j++)
        if(!privacy[i][l[j]])
          flag = !flag;
      if(flag){
        if(ans == 0)
          ans = i + 1;
        else
          ans = -1;
      }
    }

    if(ans == 0){ ans = -1; }
    cout << ans << endl;
  }



  return 0;
}

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

using namespace std;

#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(c) (c).begin(), (c).end()

int main(){
    int N;
    while(cin >> N, N){
        vector<vector<bool> > know(N, vector<bool>(N));
        rep(i, N){
            int M;
            cin >> M;
            while(M--){
                int p;
                cin >> p;
                p--;
                know[i][p] = true;
            }
        }
        vector<bool> leak(N, true);
        int K;
        cin >> K;
        while(K--){
            int l;
            cin >> l;
            l--;
            rep(i, N)if(leak[i] && !know[i][l])leak[i] = false;
        }
        cout << (count(all(leak), true) != 1? -1: find(all(leak), true) - leak.begin() + 1) << '\n';
    }
    return 0;
}

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


set<int> *p;
set<int> l;
int *m,k;

set<int>::iterator it,its;

int main(){
	int n;
	while(cin>>n){
		if(n==0) break;
		m=new int[n];
		p=new set<int>[n];
		for(int i=0;i<n;i++){
			cin>>m[i];
			int q;
			for(int j=0;j<m[i];j++){
				cin>>q;
				p[i].insert(q);
			}
		}
		cin>>k;
		int q;
		for(int j=0;j<k;j++){
			cin>>q;
			l.insert(q);
		}
		int cnt=0;
		for(int i=0;i<n;i++){
			its=p[i].begin();
			for(it=l.begin();it!=l.end();it++){
				for(;its!=p[i].end();its++){
					if((*it)<=(*its)) break;
				}
				if((*it)!=(*its)) break;
			}
			if(it==l.end()){
				if(cnt){
					cnt=-1;
					break;
				}
				cnt=i+1;
			}
		}
		if(!cnt) cnt=-1;
		cout<<cnt<<endl;
		delete []p;
		delete []m;
		l.clear();
	}
	return 0;
}

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

#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
#define all(c) (c).begin(), (c).end()
 
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main() {
  int n;
  bool flag[110][110];
  while(cin >> n, n) {
    rep(i, n+1) rep(j, n+1) flag[i][j] = false;

    rep(i, n) {
      int m; cin >> m;
      rep(j, m) {
        int x; cin >> x;
        flag[i][x] = true;
      }
    }

    int k; cin >> k;
    vi tmp(k);
    rep(i, k) cin >> tmp[i];

    vi ans;
    rep(i, n) {
      rep(j, k) {
        if(!flag[i][tmp[j]]) break;
        if(j == k-1) ans.push_back(i+1);
      }
    }
    if(ans.size() == 1) cout << ans[0] << endl;
    else cout << -1 << endl;
  }
}