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 <deque>
#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 <climits>
#include <queue>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
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(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N;
  while(cin >> N, N){
	bool table[101][101];
	fill((bool*)table, (bool*)table+101*101, false);
	REP(i,N){
	  int M; cin >> M;
	  REP(j,M){
		int x; cin >> x;
		table[i][x] = true;
	  }
	}
	int K; cin >> K;
	VI target(K);
	REP(i,K) cin >> target[i];

	int ans = -1;
	REP(i,N){
	  int j;
	  for(j=0;j<K;++j)
		if(!table[i][target[j]]) break;
	  
	  if(j == K){
		if(ans != -1){
		  ans = -1;
		  break;
		}
		else
		  ans = i+1;
	  }
	}
	cout << ans << endl;
  }
  
  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main(void) {
  int n;
  while (cin >> n, n) {
    int m[110], p[110][110];
    for (int i = 0; i < n; i++) {
      cin >> m[i];
      for (int j = 0; j < m[i]; j++) {
        cin >> p[i][j];
      }
    }

    int K, l[110];
    cin >> K;
    for (int i = 0; i < K; i++) {
      cin >> l[i];
    }

    int ans = -1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < K; j++) {
        bool none = true;
        for (int k = 0; k < m[i]; k++) {
          if (p[i][k] != l[j]) continue;
          none = false;
          break;
        }
        if (none) break;
        if (j == K - 1) {
          if (ans >= 0) ans = -1, i = n;
          else ans = i + 1;
        }
      }
    }

    cout << ans << endl;
  }

  return 0;
}

C++: //============================================================================
// Name        : A.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#define  rep(i,a) for(int i = 0; i < int(a); i++)
#include <vector>
using namespace std;

int main() {
	int K[101], k;

	vector<int> G[101];
	int N, M, x;
	while (true ) {
		cin >> N ;
		if (N == 0) break;
		rep(i,N) {
			cin >> M;
			rep(j,M) {
				cin >> x;
				G[i].push_back(x);
			}
		}
		cin >> k ;
		rep(i, k) cin >> K[i];
		int num = 0, vt;
		rep(i, N) {
			bool ok = true;
			rep(j, k) {
				bool flag = false;
				rep(z, G[i].size()) {
					if (G[i][z] == K[j]) {
						flag = true;
						break;
					}
				}
				if (!flag) {
					ok = false;
					break;
				}
			}

			if (ok) {
				num ++ ;
				vt = i;
	 		}
			}
		if (num != 1)
			cout << -1 << endl;
		else {
			cout << vt + 1 << endl;
		}
	}
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cctype>
#include <numeric>
using namespace std;

#define rep(i,n) for(int (i)=0; (i)<(int)(n); ++(i))
#define foreach(c,i) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)

const int kN = 102;
int N, M[kN], P[kN][kN], K, L[kN];

int solve() {
  vector<int> ans;
  rep(i,N) {
    bool ok = true;
    rep(j,K) {
      bool check = false;
      rep(k,M[i]) {
        if (L[j] == P[i][k]) check = true;
      }
      if (!check) ok = false;
    }
    if (ok) ans.push_back(i+1);
  }
  return ans.size() == 1 ? ans.front() : -1 ;
}

int main() {
  while (scanf("%d", &N), N) {
    rep(i,N) {
      scanf("%d", M+i);
      rep(j,M[i]) scanf("%d", P[i]+j);
    }
    scanf("%d", &K);
    rep(i,K) scanf("%d", L+i);
    printf("%d\n", solve());
  }
  return 0;
}