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 <cstdio>
#include <iostream>
#include <vector>


using namespace std;

bool t[101][101];
int n,k;

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

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

	int ans = -1;

	for (int i = 0; i < n; i++){
		int j = 0;
		for (; j < k; j++){
			if(!t[i][l[j]]) break; 
		}
		if(j == k){
			if(ans == -1) {
				ans = i + 1;
			} else {return -1;}
		}
	}

	return ans;
}

int main(){
	while(cin >> n,n){
		memset(t,0,sizeof(t));
		int ans = solve();
		cout << ans << endl;
	}
	return 0;
}

C++: #include <set>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;

int main(){
	int x,n,m,k,i;
	for(;scanf("%d",&n),n;){
		vector<set<int> >v;
		for(i=0;i<n;i++){
			set<int>s;
			for(scanf("%d",&m),k=0;k<m;k++)scanf("%d",&x),s.insert(x);
			v.push_back(s);
		}
		set<int>t;
		for(scanf("%d",&k),m=0;m<k;m++)scanf("%d",&x),t.insert(x);
		vector<int>w;
		for(k=0;k<n;k++){
			set<int>s;
			set_intersection(v[k].begin(),v[k].end(),t.begin(),t.end(),inserter(s,s.end()));
			if(s.size()==t.size()){if(!w.empty())break;w.push_back(k);}
		}
		printf("%d\n",w.size()==1?w[0]+1:-1);
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<n; i++)

int n;
int m[125];
int p[125][125];
int k;
int l[125];

int main(){
    while(true){
        cin>>n;
        if(n==0)break;
        REP(i,n){
            cin>>m[i];
            REP(j,m[i])cin>>p[i][j];
            sort(p[i],p[i]+m[i]);
        }
        cin>>k;
        REP(i,k)cin>>l[i];
        vector<int> cand;
        REP(i,n){
            int cnt = 0;
            REP(j,m[i]){
                cnt += count(l,l+k,p[i][j]);
            }
            if(cnt == k)cand.push_back(i);
        }
        if(cand.size() == 1){
            cout << cand[0]+1 << endl; 
        }else{
            cout << -1 << endl;
        }
    }
    return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std; 

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;
 
int main()
{
	while(1) {
		int n, m, k;
		cin >> n;
		if (!n) break;
		set<int> p[101];
		rep(i,0,n) {
			cin >> m;
			rep(j,0,m) {
				int t; 
				cin >> t;
				if (t != i) p[i].insert(t);
			}
		}
		Vi l;
		cin >> k;
		rep(i,0,k) {
			int t;
			cin >> t;
			l.pb(t);
		}

		
		Vi  f;
		rep(i,0,n) {
			bool f2 = true;
			rep(j,0,k) {
				auto it = lower_bound(all(p[i]),l[j]);
				if (it == p[i].end()) {
					f2 = false;
					break;
				}
			}
			if (f2) f.pb(i);
		}
		//cout << "answer is ";
		if (len(f) == 1) cout << f[0]+1 << endl;
		else cout << -1 << endl;
	}

	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main(){

    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    int m;
    int k;
    bool f;
    int cnt;
    int ans;
    vector< vector<int> > p;
    vector<int> l;

    while(cin >> n, n){

        p.resize(n);

        for (auto &x : p){

            cin >> m;
            x.resize(m);

            for (auto &y : x)
                cin >> y;

        }


        cin >> k;
        l.resize(k);

        for(auto &x : l)
            cin >> x;

        cnt = 0;
        ans = 0;

        for (int i = 0; i < n; i++){

            f = true;
            for (auto &y : l)
                if(!binary_search(p[i].begin(), p[i].end(), y)){
                    f = false;
                    break;
                }

            if(f){
                cnt++;
                ans = i + 1;
            }

        }

        if(cnt != 1)
            cout << -1 << endl;
        else
            cout << ans << endl;

    }

    return 0;
}