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 <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <set>
#include <map>
#include <cstring>
#include <cstdio>
#include <stack>
#define INF 1000000000
#define rep(i,n) for(int i =0;i<n;i++)
using namespace std;
typedef long long int ll;

int main(){
    for(;;){
        int n;
        cin >> n;
        if(!n)break;
        int g[n][n];
        memset(g, 0, sizeof(g));
        for (int i=0; i<n; i++) {
            int m;
            cin >> m;
            for (int j=0; j<m; j++) {
                int k;
                cin >> k;
                g[i][k-1]=1;
            }
        }
        int k;
        cin >> k;
        vector<int> de;
        rep(i,k){
            int l;
            cin >> l;
            de.push_back(l-1);
        }
        vector<int> ans;
        for (int i=0; i<n; i++) {
            int ch =0;
            for (int j=0; j<k; j++) {
                if(g[i][de[j]]==1)ch++;
            }
            if (ch==k) {
                ans.push_back(i+1);
            }
        }
        if (ans.size()==1) {
            cout <<ans[0] <<endl;
        }else{
            cout << -1 <<endl;
        }
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
#define D10 fixed<<setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1000000007;
const int INF = MOD + 1;
const ld EPS = 1e-12;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }

/*--------------------template--------------------*/

int main()
{
	cin.sync_with_stdio(false);
	int n;
	while (cin >> n, n)
	{
		vector<set<int>> st(n);
		REP(i, n)
		{
			int m; cin >> m;
			REP(j, m)
			{
				int a; cin >> a;
				st[i].insert(a);
			}
		}
		int m; cin >> m;
		set<int> w;
		REP(i, m)
		{
			int a; cin >> a;
			w.insert(a);
		}
		vi ans;
		REP(i, n)
		{
			bool f = true;
			for (auto j : w)
			{
				if (!st[i].count(j)) f = false;
			}
			if (f) ans.push_back(i);
		}
		if (ans.size() != 1) cout << -1 << endl;
		else cout << ans[0] + 1 << endl;
	}
	return 0;
}

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

int main(){
    int n;
    while(cin >> n,n){
        vector<int> m(n);
        //vector<vector<int> > p;
        int p[100][100];
        for(int i=0;i<n;i++){
            cin >> m[i];
            for(int j=0;j<m[i];j++){
                cin >> p[i][j];
            }
            //sort(p[i].begin(),p[i].end());
        }

        int k;
        cin >> k;
        vector<int> l(k);
        for(int i=0;i<k;i++){
            cin >> l[i];
        }
        //sort(l.begin(),l.end());

        int frg=0;
        for(int i=0;i<n;i++){
            if(m[i]<k)continue;
            int sfrg=1;
            int sm=0;
            for(int j=0;j<k;j++){
                if(sfrg==0)break;
                for(int a=0;a<m[i];a++){
                    if(p[i][a]==l[j]){
                        sm++;
                        break;
                    }
                    else if(p[i][a]>l[j]){
                        sfrg=0;
                        break;
                    }
                }
                if(sm==k){
                    if(frg==0)frg=i+1;
                    else frg=-1;
                }
            }
        }

        if(frg>0)cout << frg << endl;
        else cout << "-1" << endl;
    }
    return 0;
}