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<iostream>
#include<algorithm>
using namespace std;
int x[200][200], y[200], z[200], n, i, a, j;
int main() {
	while (true) {
		cin >> n;
		if (!n) { break; }
		for (i = 1; i <= n;i++){
			cin >> z[i];
			for (j = 0; j < z[i];j++){
				cin >> x[i][j];
			}
			sort(x[i], x[i] + z[i]);
		}
		cin >> a;
		for (i = 0; i < a; i++) { cin >> y[i]; }sort(y, y + a);
		for (i = 1; i <= n; i++) {
			if (z[i] == a) {
				for (j = 0; j < z[i]; j++) {
					if (y[j] != x[i][j]) {
						goto E;
					}
				}
				a = i;
				goto F;
			E:;
			}
		}
	F:; cout << a << endl;
	}
}

C++: #include <iostream>
using namespace std;
int main(){
	int n;
	while(cin>>n){
		if(n==0) break;
		int m,p[n][n],shitteru;
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				p[i][j]=0;
			}
		}
		for(int i=0;i<n;i++){
			cin>>m;
			for(int j=0;j<m;j++){
				cin>>shitteru;
				p[i][shitteru-1]=1;
			}
		}
		int k;
		cin>>k;
		int l[k];
		for(int i=0;i<k;i++){
			cin>>l[i];
		}
		int hannin=-1;
		for(int i=0;i<n;i++){
			int flg=1;
			for(int j=0;j<k;j++){
				if(p[i][l[j]-1]==0){
					flg=0;
					break;
				}
			}
			if(flg==1&&hannin==-1){
				hannin=i+1;
			}
			else if(flg==1&&hannin>-1){
				hannin=-1;
				break;
			}
		}
		cout<<hannin<<endl;
	}
    return 0;
}

C++: //
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015??´ 13B10694. All rights reserved.
//

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
    int n, in, m, k;
    while(cin>>n,n){
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            
	  if(vec[i].empty() && !vect.empty())continue;
	  int now=0;
	  int j;int out =0,count=0;
	  for(j=0;j<vect.size();j++){
	    
	    while(vect[j]>vec[i][now]){
	      now++;
	      if(now >= (int)vec[i].size()){
		out=1;
		break;
	      }
	    }
            
	    if(vect[j]<vec[i][now]||out==1)
	      break;
	    if(vect[j]==vec[i][now]){
	      now++;count++;
	    }
	  }
	  if(out==1)continue;
	  

	  // if(vect[vect.size()-1]==vec[i][now-1]&&count==(int)vect.size()){
	  if((int)vect.size() == count) {
	    suc++;
	    po = i+1;
//	    cout << "=======" << i << endl;
//	    cout<<out<<endl;
//	    for(int j=0; j<vec[i].size(); j++) cout << vec[i][j] << " ";
//	    cout << endl;
//	    for(int j=0; j<vect.size(); j++) cout << vect[j] << " ";
//	    cout << endl;
//       	  }
//        }
//        if(suc==1){
//	  cout<<po<<endl;
//        }
//        else{
//	  cout << -1<<endl;
//        }
          int mamam=out;
      }
    
    return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std; 

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;
 
int main()
{
	while(1) {
		int n, m, k;
		cin >> n;
		if (!n) break;
		set<int> p[101];
		rep(i,0,n) {
			cin >> m;
			p[i].insert(i);
			rep(j,0,m) {
				int t; 
				cin >> t;
				p[i].insert(t);
			}
		}
		Vi l;
		cin >> k;
		rep(i,0,k) {
			int t;
			cin >> t;
			l.pb(t);
		}

		
		Vi  f;
		rep(i,0,n) {
			bool f2 = true;
			rep(j,0,k) {
				auto it = lower_bound(all(p[i]),l[j]);
				if (it == p[i].end()) {
					f2 = false;
					break;
				}
			}
			if (f2) f.pb(i);
		}
		//cout << "answer is ";
		if (len(f) == 1) cout << f[0]+1 << endl;
		else cout << -1 << endl;
	}

	return 0;
}