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;

int main(){
  int N,K,ans;
  int p[100][100];
  int l[100];

  while(true){
    cin >> N;
    if(N == 0) break;

    int *M = new int[N];
    
    for(int i=0;i<N;++i){
      cin >> M[i];

    
      for(int ix=0;ix<M[i];++ix){
	cin >> p[i][ix];
      }
    }
    
    cin >> K;
    
    for(int i=0;i<K;++i)
      cin >> l[i];
    
    
    int cnt = 0;
    for(int i=0;i<N;++i){
      if(K>M[i]) break;
      
      bool w = true;
      for(int k=0;k<K;++k){
	for(int ix = 0; ix<M[i]; ++ix){
	  if(l[k] == p[i][ix]){
	    break;
	  }
	  if(ix == M[i] - 1) w = false;
	}
	if(!w) break;
      }
      
      if(w) {
	++cnt;
	ans = i;
      }
    }

    if(cnt == 1){
      cout << ans + 1 << endl;
    }else{
      cout << -1 << endl;
    }

    delete[] M;

  }
  
  return 0;
}

C++: #define  _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#pragma comment (linker, "/STACK:526000000")

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(10);
}

#define int ll
void solve() {
	while (true) {
		int n;
		cin >> n;
		if (n == 0) return;
		vector<vector<int>> inputs;
		REP(i, n) {
			int a;
			cin >> a;
			vector<int> geko;
			REP(i, a) {
				int b;
				cin >> b;
				geko.push_back(b);
			}
			inputs.push_back(geko);
		}
		int k;
		cin >> k;
		vector<int> tmps;
		REP(i, k) {
			int a;
			cin >> a;
			tmps.push_back(a);
		}
		vector<int> ans;
		REP(i, n) {
			int ok = 1;
			for (int q = 0; q < k; ++q) {
				int geko = 0;
				REP(j, inputs[i].size()) {
					if (tmps[q] == inputs[i][j]) {
						geko = 1;
					}
				}
				if (geko == 0) {
					ok = 0;
				}
			}
			if (ok == 1) {
				ans.push_back(i + 1);
			}
		}
		if (ans.size() != 1) {
			cout << -1 << endl;
			continue;
		}
		cout << ans[0] << endl;
	}
}
#undef int

int main() {
	init();
	solve();
}

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