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 <cstdio>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <cmath>
#include <algorithm>
#include <map>
#include <list>
#include <cstdlib>

using namespace std;

typedef pair<int, int> P;

#define MAX 128

int main()
{
	while(1) {
		int n;
		bool know[MAX][MAX] = {false};
		bool leak[MAX];

		for(int i = 0; i < MAX; i++) {
			leak[i] = true;
		}
		
		scanf("%d", &n);
		if(!n) break;
		for(int i = 1; i <= n; i++) {
			int m;
			scanf("%d", &m);
			while(m--) {
				int p;
				scanf("%d", &p);
				know[i][p] = true;
			}
		}

		int k;
		scanf("%d", &k);
		while(k--) {
			int l;
			scanf("%d", &l);
			for(int i = 1; i <= n; i++) {
				if(!leak[i]) continue;
				if(!know[i][l]) {
					leak[i] = false;
				}
			}
		}

		int ans = -1;
		for(int i = 1; i <= n; i++) {
			if(!leak[i]) continue;
			if(ans > 0) {
				ans = -1;
				break;
			}
			ans = i;
		}
		printf("%d\n", ans);
	}
	return 0;

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

using namespace std;

vector<map<int,int>> known;
vector<int> leak;

int main(){
	int n;
	while(cin>>n, n){
		//M
		for(int i=0;i<n;i++){
			known.push_back(map<int,int>());
			int nknow;
			cin >> nknow;
			for(int j=0;j<nknow;j++){
				int tmp;
				cin >> tmp;
				known[i].insert(make_pair(tmp,j));
			}
		}
		//K
		int k;
		cin >> k;
		leak = vector<int>(k);
		for(int ik=0;ik<k;ik++){
			int tmp;
			cin >> tmp;
			leak[ik] = tmp;
		}

		//??¢?´¢
		int flag = 1;
		int targ = -2;
		for(int i=0;i<n;i++){
			for(int num: leak){
				auto it = known[i].find(num);
				if(it == known[i].end()){
					flag = 0;
					break;
				}else{
					//cout << it->second << endl;
				}
			}
			if(targ == -2 && flag == 1){
				targ = i;
			}
			else if(targ != -2 && flag == 1){
				targ = -1;
				break;
			}
			flag = 1;
		}
		if(targ == -1) targ = -2;
		cout << targ+1 << endl;
		known.clear();
		leak.clear();
	}

	return 0;
}

C++: //
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015????´ 13B10694. All rights reserved.
//

#include <iostream>
#include <vector>
#include<stdio.h>
#include <algorithm>
using namespace std;

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
   //freopen("/Users/shitian/Downloads/in.txt", "r", stdin);
    int n, in, m, k;
    while(cin>>n){
        if(n==0)break;
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            
            if(vec[i].empty() && !vect.empty())continue;
            int now=0;
            int j;int out =0,count=0;
            for(j=0;j<vect.size();j++){
                
                while(vect[j]>vec[i][now]){
                    now++;
                    if(now >= (int)vec[i].size()){
                        out=1;
                        break;
                    }
                }
                
                if(vect[j]<vec[i][now]||out==1)
                    break;
                if(vect[j]==vec[i][now]){
                    now++;count++;
                }
            }
            // cout<<"out:  "<<out<<"     count:  "<<count<<endl;
            if(out==1){continue;}
            //cout<<"out:  "<<out<<"     count:  "<<count<<endl;
            
            // if(vect[vect.size()-1]==vec[i][now-1]&&count==(int)vect.size()){
            if((int)vect.size() == count) {
                suc++;
                po = i+1;
                //                cout<<"out: "<<out<<endl;
                //                      cout << "=======" << i << endl;
                //                      cout<<out<<endl;
                //                      for(int j=0; j<vec[i].size(); j++) cout << vec[i][j] << " ";
                //                      cout << endl;
                //                      for(int j=0; j<vect.size(); j++) cout << vect[j] << " ";
                //                      cout << endl;
                
            }
        }
        int fai= -1;
        if(suc==1){
            printf("%d\n",po);
        }
        else{
            printf("-1\n");
        }
        
    }
    
    return 0;
}

C++: results = []

while True:
    N = int(input())
    if N == 0:
        break
       
    A = [list(map(int, input().split())) for _ in range(N)]
    K = list(map(int, input().split()))
    
    count = 0
    for i in range(N):
        tmp = 0
        A[i][0] = -1
        for j in range(K[0]):
            if K[j+1] in A[i]:
                tmp += 1
                
        if tmp == K[0]:
            count += 1
            res = i + 1
    
    if count == 1:
        results.append(res)
    else:
        results.append(-1)
        
for result in results:
    print(result)