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

int main ()
{
    int n;
    while (cin >> n, n) {
        vector<set<int> > v(n, set<int>());
        for (int i = 0; i < n; i++) {
            int tmp;
            cin >> tmp;
            while (tmp--) {
                int tmpp;
                cin >> tmpp;
                v[i].insert(tmpp);
            }
        }

        set<int> more;
        int m;
        cin >> m;
        while (m--) {
            int tmp;
            cin >> tmp;
            more.insert(tmp);
        }

        vector<int> res;
        for (int i = 0; i < n; i++) {
            if (more.size() <= v[i].size()) {
                int flag = true;
                for (auto j : more) {
                    if (v[i].find(j) == v[i].end()) {
                        flag = false;
                        break;
                    }
                }
                if (flag) res.push_back(i+1);
            }
        }

        cout << (res.size() == 1 ? res[0] : -1) << endl;
    }

    return 0;
}

C++: // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2399

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main() {
  int N;
  while (cin >> N && N) {
    bool D[110][110];
    fill(&D[0][0], &D[0][0]+110*110, false);
    for (auto i=0; i<N; i++) {
      int M;
      cin >> M;
      for (int j=0; j<M; j++) {
	int p;
	cin >> p;
	D[i][p] = true;
      }
    }
    int K;
    cin >> K;
    vector<int> E;
    for (auto i=0; i<K; i++) {
      int l;
      cin >> l;
      E.push_back(l);
    }
    int c = 0;
    int last;
    for (auto i=0; i<N; i++) {
      for (auto j=0; j<E.size(); j++) {
	if (!D[i][E[j]]) {
	  goto EXIT;
	}
      }
      c++;
      last = i+1;
      // cerr << "c = " << c << ", last = " << last << endl; 
    EXIT:
      continue;
    }
    if (c != 1) {
      cout << "-1" << endl;
    } else {
      cout << last << endl;
    }
  }
}

C++: #include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
typedef long long int ll;
//typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};

using namespace std;

int main(){
    int n;
    while(cin>>n &&n){
        vector<vector<int>> v(n,vector<int>(n));
        rep(i,0,n){
            int x; cin>>x;
            rep(j,0,x){
                int num; cin>>num; num--;
                v[i][num]=1;
            }
        }
        int k; cin>>k;
        vector<int> ans;
        rep(i,0,k){
            int num; cin>>num; num--;
            ans.pb(num);
        }
        
        int count=0,ansnum=0;
        rep(i,0,n){
            bool ok=true;
            rep(j,0,ans.size()){
                if(v[i][ans[j]]!=1)ok=false;
            }
            if(ok){
                count++;
                ansnum=i+1;
            }
        }
        if(count==1)cout<<ansnum<<endl;
        else cout<<-1<<endl;
    }
    
    return 0;
}

C++: #include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>

using namespace std;

#define INF 999999999

int main(){
	int i, j, n, m, k, v;
	bool know[101][101], l[101];
	int ans, sus;
	while(1){
		cin >> n;
		if(!n) break;
		ans = -1;
		sus = 0;
		for(i=0;i<=100;i++){
			l[i] = false;
			for(j=0;j<=100;j++){
				know[i][j]=false;
			}
		}
		for(i=1;i<=n;i++){
			cin >> m;
			for(j=0;j<m;j++){
				cin >> v;
				know[i][v] = true;
			}
		}
		cin >> k;
		for(i=0;i<k;i++){
			cin >> v;
			l[v] = true;
		}
		for(i=1;i<=n;i++){
			bool white = false;
			for(j=1;j<=n;j++){
				if(l[j] && !know[i][j]){
					white = true;
					break;
				}
			}
			if(!white){
				if(!sus){
					ans = i;
					sus++;
				}
				else{
					ans = -1;
					break;
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}