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++: 
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2399

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

class member
{
	private:
		int id;
		bool flag;
		vector<int> privacy_list;
	public:
		member(int ID):id(ID), flag(false){}

		void set_flag(bool FLAG){
			flag = FLAG;
		}

		bool get_flag(){
			return flag;
		}

		int get_id(){
			return id;
		}

		void add(int ID){
			privacy_list.push_back(ID);
		}

		bool check_list(int ID)
		{
			bool check=false;
			rep(i,privacy_list.size()){
				if(ID == privacy_list[i]){ check=true; }
			}
			return check;
		}

		void show()
		{
			dump(id);
			dump(flag);
			DUMP(privacy_list);
		}
};

int main()
{
	int N,M;
	while(cin >> N && N)
	{
		vector<member> members;

		rep(i,N)
		{
			members.push_back(member(i+1));
			cin >> M;

			int tmp;
			rep(j,M)
			{
				cin >> tmp;
				members[i].add(tmp);
			}
		}

		

		int K;
		cin >> K;
		vector<int> leak(K);
		rep(i,K){
			cin >> leak[i];
		}	

		rep(j,N)
		{
			bool flag=true;
			rep(i,leak.size())
			{
				if(!members[j].check_list(leak[i])){
					flag = false;
				}		
			}
			members[j].set_flag(flag);
		}
	
		vector<int> ans;
		rep(i,members.size()){
			if(members[i].get_flag()){ans.push_back(members[i].get_id());}
		}

		cout << (ans.size() == 1 ? ans[0] : -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;
          }

        }
      }
      
        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;
}