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

        }
      }
      for(int j = 0;j<k;j++){
        cout <<"Debug visited"<<visited[i]<<endl;
      }
      cout <<"Debug "<<accumulate(visited,visited+k,0) <<endl;
        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;
}

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

C++: #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
    int n;
    while(scanf("%d",&n),n){
        bool f[100][100];
        int l[100];
        int ln;
        fill_n(*f,100*100,false);
        for(int i=0;i<n;i++){
            int m;
            scanf("%d",&m);
            for(int j=0;j<m;j++){
                int to;
                scanf("%d",&to);
                to--;
                f[i][to]=true;
            }
        }
        scanf("%d",&ln);
        for(int i=0;i<ln;i++){
            scanf("%d",&l[i]);
            l[i]--;
        }
        int ans=-1;
        for(int i=0;i<n;i++){
            bool flag=true;
            for(int j=0;j<ln;j++){
                flag&=f[i][l[j]];
            }
            if(flag){
                if(ans==-1)ans=i;
                else if(ans!=-100){
                    ans=-100;
                }
            }
        }
        if(ans==-1||ans==-100)puts("-1");
        else printf("%d\n",ans+1);
    }
    return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int N;
	while (cin >> N && N != 0)
	{
		int member[100][100] = {};
		int M[100] = {};
		int K;
		int L[100] = {};
		for (int i = 0; i < N; i++)
		{
			cin >> M[i];
			for (int j = 0; j < M[i]; j++)
			{
				int p;
				cin >> p;
				member[i][j] = p;
			}
		}

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

		int ansCount = 0;
		int ansNumber = -1;
		for (int i = 0; i < N; i++)
		{
			int cnt = 0;
			for (int j = 0; j < M[i]; j++)
			{
				for (int k = 0; k < K; k++)
				{
					if (L[k] == member[i][j])cnt++;
				}
			}
			if (cnt == K)
			{
				ansNumber = i + 1;
				ansCount++;
			}
		}

		if (ansCount > 1 || ansNumber == -1)
		{
			cout << -1 << endl;
		}
		else
		{
			cout << ansNumber << endl;
		}
	}
	return 0;
}