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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>

using namespace std;

//conversion
//------------------------------------------
inline long toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-12;
const int INF = 10000;



int main(){
	int N,M,K;
	while(cin>>N){
		if(N==0)break;
		set<int>mem[101];
		REP(i,N){
			cin>>M;
			REP(j,M){
				int p;
				cin>>p;
				mem[i].insert(p);
			}
		}
		cin>>K;
		vector<int>L(K),res;
		REP(i,K)cin>>L[i];
		REP(i,N){
			bool flag=true;
			REP(j,K)if(mem[i].find(L[j])==mem[i].end())flag=false;
			if(flag)res.PB(i+1);
		}
		if(SZ(res)==1)cout<<res[0]<<endl;
		else cout<<-1<<endl;
	}
	return 0;
}

C++: #include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n);i<(N);i++)
#define RREP(i,n,N) for(ll i=(N-1);i>=(n);i--)
#define p(s) cout<<(s)<<endl
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
typedef long long ll;
const ll mod =1e9+7;
const ll inf =1e18;
using namespace std;

ll N, K;
ll M[101], l[101];
ll P[101][101];
int main(){
    while(cin>>N, N){
        REP(i, 0, N){
            cin>>M[i];
            REP(j, 0, M[i]) cin>>P[i][j];
            sort(P[i], P[i]+M[i]);
        }
        cin>>K;
        REP(i, 0, K) cin>>l[i];
        sort(l, l+K);

        /*
        REP(i, 0, N){
            REP(j, 0, M[i]){
                cout<<P[i][j]<<" ";
            }
            cout<<endl;
        }
        REP(i, 0, K){
            cout<<l[i]<<" ";
        }
        cout<<endl;
         */


        ll cnt=0, ans=-1;
        REP(i, 0, N){
            ll idxa=0, idxb=0;
            bool flag=false;
            while(idxa<M[i]){
                if(P[i][idxa]==l[idxb]){
                    idxb++;
                }
                idxa++;

                if(idxb>=K){
                    flag=true;
                    cnt++;
                    ans=i+1;
                    break;
                }
            }
        }

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

    }
    return 0;
}

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

int main() {
	int n;
	while(cin >> n && n){
		int m, p, k, l[128] = {0};
		bool know[128][128] = {0};
		for(int i = 1; i <= n; ++i){
			cin >> m;
			for(int j = 0; j < m; ++j){
				scanf("%d", &p);
				know[i][p] = true;
			}
		}
		cin >> k;
		for(int i = 0; i < k; ++i){
			scanf("%d", &l[i]);
		}
		int cnt = 0, ans = 0;
		for(int i = 1; i <= n; ++i){
			for(int j = 0; j < k; ++j){
				if(!know[i][l[j]])
					break;
				if(j == k - 1){
					cnt++;
					ans = i;
				}
			}
		}
		if(cnt == 1)
			cout << ans << endl;
		else
			cout << "-1" << endl;
	}
	return 0;
}