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 <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>

#define el endl
#define fd fixed
#define INF INT_MAX/2-1
#define pb push_back

using namespace std;

int main() {
  int N, M, K, tmp;
  bool flag;
  while (cin >> N, N) {
    vector<vector<int> > vv(N);
    vector<int> leak;
    vector<int> criminal;
    for (int i = 0; i < N; i++) {
      cin >> M;
      for (int j = 0; j < M; j++) {
        cin >> tmp;
        vv[i].pb(tmp-1);
      }
    }
    cin >> K;
    for (int i = 0; i < K; i++) {
      cin >> tmp;
      leak.pb(tmp-1);
    }
    for (int i = 0; i < N; i++) {
      flag = true;
      for (int j = 0; j < K; j++) {
        vector<int>::iterator itr = find(vv[i].begin(), vv[i].end(), leak[j]);
        if (itr == vv[i].end()) {
          flag = false;
          break;
        }
      }
      if (flag) {
        criminal.pb(i+1);
      }
    }
    if (criminal.size() == 1) {
      cout << criminal[0] << el;
    } else {
      cout << "-1" << el;
    }
  }
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
	long long int N, M, L;
	while( cin >> N, N ) {
		vector<set<long long int>>d( N );
		for( size_t i = 0; i < N; i++ ) {
			d[i].insert( i + 1 );
			cin >> M;
			for( size_t j = 0; j < M; j++ ) {
				cin >> L;
				d[i].insert( L );
			}
		}
		cin >> M;
		vector<long long int>x( M );
		for( size_t i = 0; i < M; i++ ) {
			cin >> x[i];
		}
		[&] () {
			long long int ans = -1;
			for( size_t i = 0; i < N; i++ ) {
				auto ret = [&] () {
					for( size_t j = 0; j < M; j++ ) {
						if( d[i].find( x[j] ) == d[i].end() ) {
							return -1LL;
						}
					}
					return (long long int)i;
				}();
				if( ans == -1 ) {
					ans = ret;
				} else {
					if( ret != -1 ) {
						cout << -1 << endl;
						return;
					}
				}
			}
			if( ans == -1 ) {
				cout << ans << endl;
			} else {
				cout << ans + 1 << endl;
			}
			return;
		}();
	}
}

C++: #include <iostream>

using namespace std;

int main()
{
  int n;
  int i,j,k;
  while(1){
	cin >> n;
	if(n == 0) break;
	int m[200];
	int p[200][200];

	for (i = 0; i < n; i++) {
	  cin >> m[i];
	  for (j = 0; j < m[i]; j++) {
		cin >> p[i][j];
	  }
	}
	cin >> k;
	int hoge;
	int l[200];
	for(hoge = 0;hoge < k; hoge++){
	  cin >> l[hoge];
	}

	int ans = 0;
	int c = 0;

	for(i = 0; i < n; i++){
	  for(j = 0; j < m[i]; j++){
		for(int a = 0; a < k; a++){
		  if(l[a] == p[i][j]){
			c++;
			break;
		  }// else if(l[a] > p[i][j]){
		  // 	break;
		  // }
		}
		if(c == k){
		  if(ans == 0) {
			ans = (i+1);
			// cout << i << endl;
			break;
		  }
		  else {
			ans = -1;
			break;
		  }
		}
	  }
	  c = 0;
	}

	if(ans == 0) ans = -1;


	cout << ans << endl;

  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n;
  while(cin>>n,n){
    int ans=-1;
    int p[101][101]={};
    int m[101];
    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[101]={};
    bool flag=false, th=false;
    cin>>k;
    for(int i=0;i<k;++i) cin>>l[i];
    for(int i=0;i<n;++i){
      int cnt=0;
      for(int o=0;o<k;++o){
        for(int j=0;j<m[i];++j){
          if(l[o]==p[i][j]) cnt++;
        }
      }
      if(cnt==k){
        if(flag) th=true;
        ans=i+1;
        flag=true;
      }
    }
    if(th) cout<<-1<<endl;
    else cout<<ans<<endl;
  }
  return 0;
}