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[50];
		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>
using namespace std;
/*cout <<"Debug"
cout <<x-30<<' '<<y-30<<endl;*/
vector<string>v;
vector<int>ansl;
string s;
int ary[100005] = {0};
int lst[200][200];
int cnt = 0;
int d_x[] = {1, 1, 0, -1, -1, 0};
int d_y[] = {1, 0, -1, -1, 0, 1};
int t;
/*
void dfs(int x,int y,int lpcnt){
  mp[x][y] = 1;
  cout <<"Debug ";
  cout <<x-30<<' '<<y-30<<endl;
  cnt++;
  lpcnt++;
  int watasi = lpcnt;
  int used[6] = {0};
  for(int dx = 0;dx<6;dx++){
    int nx = x+d_x[dx],ny = y+d_y[dx];
    int dft = sqrt((nx-30)*(nx-30)+(ny-30)*(ny-30));
    if((dft<=30)&&(watasi < t)&&(mp[nx][ny] == 0)){
        dfs(nx,ny,watasi);
        used[dx] = 1;
    }
    for(int i = 0;i<6;i++){
      if(used[i]){
        if((nx == x + d_x[i])&&(ny == y + d_y[i])){
          dfs(nx,ny,watasi);
        }
      }
    }
    }
}
*/
int main(){
  int N;

  cin >>N;
  while(N != 0){
    int num = 1,flg = 0 ,ans = 0;
    int roueied[101] = {1000};
    for(int i = 0;i<200;i++){
      for(int j = 0;j<200;j++){
        lst[i][j] = 1000;
      }
    }
    for(int i = 1;i<=N;i++){
      int M;
      cin >>M;
      lst[i][0] = M;
      for(int j = 1;j<=M;j++){
        cin >>lst[i][j];
      }
    }

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

    for(int i = 1;i<=N;i++){
      if(lst[i][0] < k)continue;

      int visited[101];
      for(int j = 0;j<k;j++){
        visited[j] = 1;
      }

      for(int j = 1;j<=lst[i][0];j++){
        for(int z = 0; z < k ; z++){
          if(lst[i][j] == roueied[z]){
            visited[z] =  0;
          }

        }
      }
      /*for(int j = 0;j<k;j++){
        /*cout <<"Debug visited"<<visited[i]<<endl;*/
      }
      /*cout <<"Debug "<<accumulate(visited,visited+k,0) <<endl;*/
        if((accumulate(visited,visited+k,0) == 0 )&&(flg == 1)){
          ans = -1;
          break;
        }
        if(accumulate(visited,visited+k,0) == 0){
          flg = 1;
          ans = i;
        }

      }
      if((ans == -1)||(flg == 0)){
        ans = -1;
    }
    ansl.push_back(ans);
    cin >>N;
  }


  for(int i = 0;i<(int)ansl.size();i++){
    cout <<ansl[i]<<endl;
  }
  return 0;
}

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

int main(){

int N;
while(1){
cin>>N;if(N==0)break;
int M;
bool n[103][103]={};
for(int i=1;i<=N;i++){
cin>>M;
for(int j=0;j<M;j++)
{int x;cin>>x;n[i][x]=true;}
}

bool R[101]={};
cin>>M;
for(int i=0;i<M;i++)
{int x;cin>>x;R[x]=true;}
int c=0,k=0;

for(int i=1;i<=N;i++){bool f=true;
for(int j=1;j<=N;j++)
{
if(n[i][j]!=R[j]&&R[j]==true)f=false;
}
if(f==true){c++;k=i;}
}

if(c==1)cout<<k<<endl;
else{cout<<"-1"<<endl;}
}
return 0;
}