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 <bits/stdc++.h>

using namespace std;

bool is_subset(vector<int> large,vector<int> small){
	bool ret = true;
	for(auto it = small.begin();it != small.end();it++){
		if(find(large.begin(),large.end(),*it) == large.end()) ret = false;
	}
	return ret;
}

int main(){
	int n;
	while(cin >> n,n){
		vector<vector<int>> p(n);
		for(int i=0;i<n;i++){
			int m;
			cin >> m;
			for(int j=0;j<m;j++){
				int pi;
				cin >> pi;
				p[i].emplace_back(pi);
			}
		}
		int k;
		cin >> k;
		vector<int> l(k);
		for(int i=0;i<k;i++){
			cin >> l[i];
		}
		int ans = 0;
		for(int unsigned i = 0;i<n;i++){
			if(is_subset(p[i],l)){
				if(ans==0) ans = i+1;
				else ans = -1;
			}
		}
		if(ans) cout << ans << endl;
		else cout << -1 << endl;
	}
	return 0;
}

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

typedef long long ll;

int main(){
	int n;
	ll p[100][2];
	while(cin>>n&&n){
		memset(p,0,sizeof(p));
		for(int i=0;i<n;i++){
			int m;
			cin>>m;
			for(int j=0;j<m;j++){
				int a;
				cin>>a;
				p[i][a/64] |= 1<<(a&63);
			}
		}
		int k;
		ll q[2]={0};
		cin>>k;
		for(int i=0;i<k;i++){
			int a;
			cin>>a;
			q[a/64] |= 1<<(a&63);
		}
		int ans=-1;
		for(int i=0;i<n;i++){
			if((p[i][0]&q[0])==q[0]&&(p[i][1]&q[1])==q[1]){
				if(ans==-1)ans=i+1;
				else{
					ans=-1;
					break;
				}
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int main(){
	while(1){
		int n,k;
		int cdata[101];
		cin >> n;
		if(n==0) break;
		vector<int> data[101];
		REP(i,n){
			int m;
			cin >> m;
			REP(j,m){
				int tmp;
				cin >> tmp;
				data[i].pb(tmp);
			}
		}
		cin >> k;
		REP(i,k) cin >> cdata[i];
		bool flag;
		int cnt = 0;
		int ans;
		REP(i,n){
			flag = true;
			REP(j,k){
				if(!binary_search(data[i].begin(),data[i].end(),cdata[j])) flag = false;
			}
			if(flag){
				cnt++;
				ans = i+1;
			}
		}
		if(cnt==1){
			cout << ans << endl;
		}else{
			cout << -1 << endl;
		}

	}
}

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

using namespace std;

int main() {
	int N;
	while (1) {
		cin >> N;
		if (N == 0)break;
		vector<int> know[101];
		for (int i = 1; i <= N; i++) {
			int M;
			cin >> M;
			for (int j = 0; j < M; j++) {
				int a;
				cin >> a;
				know[a].push_back(i);
			}
		}
		int K;
		cin >> K;
		int cnt[101] = {};
		for (int i = 0; i < K; i++) {
			int a;
			cin >> a;
			for (int j = 0; j < know[a].size(); j++)cnt[know[a][j]]++;
		}
		int who = -1;
		int c = 0;
		for (int i = 1; i <= N; i++) {
			if (cnt[i] == K)c++, who = i;
		}
		if (c == 1)cout << who << endl;
		else cout << -1 << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>

using namespace std;

typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;

const int INF = INT_MAX / 4;

#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); i++ )
#define UREP( i, m, n ) for ( ui i = (ui)( m ); i < (ui)( n ); i++ )
#define EACH( v, c ) for ( __typeof( c.front() ) &v : c )

#define ITER( c ) __typeof( (c).begin() )
#define IREP( c, it ) for ( ITER(c) it = c.begin(); it != c.end(); ++it )
#define ALL( c ) (c).begin(), (c).end()
#define RALL( c ) (c).rbegin(), (c).rend()

#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )

#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define DEBUG( x ) cerr << __FILE__ << ":" << __LINE__ << ": " << #x << " = " << ( x ) << endl

int main()
{
	while ( true )
		{
		int n;
		cin >> n;
		
		if ( n == 0 )
		{
			break;
		}

		vector< set<int> > knows( n );

		for ( auto &per : knows )
		{
			int	m;
			cin >> m;

			REP( i, 0, m )
			{
				int p;
				cin >> p;
				per.insert( p );
			}
		}

		int k;
		cin >> k;

		vector<int> ls( k );

		for ( auto &l : ls )
		{
			cin >> l;
		}

		VI res;

		REP( i, 0, n )
		{
			bool flag = true;

			REP( j, 0, k )
			{
				if ( !EXIST( knows[i], ls[j] ) )
				{
					flag = false;
				}
			}

			if ( flag )
			{
				res.PB( i + 1 );
			}
		}

		if ( res.size() == 1 )
		{
			cout << res[0] << endl;
		}
		else
		{
			cout << -1 << endl;
		}
	}

	return 0;
}