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>
using namespace std;
int n,m,p,i,j,k,l[100],b;
main(){
  while(cin>>n,n){
    bool s[100][100];
    for(i=0;i<n;++i)for(cin>>m,j=0;j++<m;s[i][p]=1)cin>>p;
    for(cin>>i,j=0;j<i;)cin>>l[j++];
    for(p=j=0;j<n;b?p=p?-1:j+1:0,++j)for(b=1,k=0;k<i;++k)b&=s[j][l[k]];
    cout<<(!p||!~p?-1:p)<<endl;
  }
}

C++: #include<iostream>
#include<string.h>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
typedef pair<int, int> pii;

int main()
{
  int n,m,k;
  int i,j;
  int a;

  while(1){
    cin>>n;
    if(n==0)break;
    int p[105][105]={};
    int l[105]={};
    rep(i,n){
      cin>>m;
      rep(j,m){
	cin>>a;
	p[i][a]++;
      }
    }
    cin>>k;
    rep(i,k){
      cin>>a;
      l[a]++;
    }

    queue<int> q;

    rep(i,n){
      bool ans=true;
      rep(j,105)
	if(l[j]>p[i][j])
	  ans=false;
      if(ans)q.push(i);
    }
    if(q.size()==1)
      cout<<q.front()+1<<endl;
    else
      cout<<"-1"<<endl;
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ALL(a) (a).begin(),(a).end()
#define pb(x) push_back(x)
#define ms(m,v) memset(m,v,sizeof(m))
#define D10  fixed<<setprecision(10) 
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;
struct edge{ int from, to, cost; };

int main()
{
	int n;
	while (cin >> n, n)
	{
		bool data[105][105] = {};
		REP(i, n)
		{
			int k; cin >> k;
			REP(j, k)
			{
				int x; cin >> x;
				data[i][x] = true;
			}
		}
		int k; cin >> k;
		vector<int> v;
		REP(i, k)
		{
			int x; cin >> x;
			v.push_back(x);
		}
		int ans = -2;
		bool ansb = true;
		REP(i, n)
		{
			bool f = true;
			REP(j, k)
			{
				if (data[i][v[j]] == false) f = false;
			}
			if (f)
			{
				if(ans == -2) ans = i;
				else ansb = false;
			}
		}
		if (ansb) cout << ans+1 << endl;
		else cout << -1 << endl;
	}

	return 0;
}