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;
  bool graph[101][101];
  bool rouei[101];
  while(cin >> n, n){
    int num = -2;
    for(int i = 1; i < 100; ++i){
      rouei[i] = false;
      for( int j = 1; j < 100; ++j)
        graph[i][j] = false;
    }
    for(int i = 1; i <= n; ++i){
      int m; cin >> m;
      for(int j = 0; j < m; ++j){
        int tmp; cin >> tmp;
        graph[i][tmp] = true;
      }
    }
    int k; cin >> k;
    for(int i = 0; i < k; ++i){
      int tmp; cin >> tmp;
      rouei[tmp] = true;
    }
    for(int i = 0; i < 100 ; ++i){
      bool flag = true;
      for( int j = 0; j < 100 && flag; ++j){
        if(rouei[j]){
          if(!graph[i][j]) flag = false;
        }
      }
      if(flag && num == -2)
        num = i;
      else if(num != -2 && flag)
        num = -1;
    }
    if(num == -2) num = -1;
    cout << num << endl;
  }
  return 0;
}

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

int n;
int m[110];
int p[110][110];
int k;
int l[110];
bool date[110][110];
int main(){
  while(1){
    for(int i=0;i<110;i++)
      for(int j=0;j<110;j++)
	date[i][j]=0;
    cin>>n;
    if(n==0)break;
    for(int i=1;i<=n;i++){
      cin>>m[i];
      for(int j=1;j<=m[i];j++){
	cin>>p[i][j];
	date[i][p[i][j]]=1;
      }
    }
    cin>>k;
    for(int i=1;i<=k;i++){
      cin>>l[i];
    }
    int ans=0;
    int crimer;
    for(int i=1;i<=n;i++){
      int flag=1;
      for(int j=1;j<=k;j++){
	if(date[i][l[j]]==0){
	  flag=0;
	  break;
	}
      }
      if(flag){
	ans++;
	crimer=i;
      }
    }
    if(ans==1){
      cout<<crimer<<endl;
    }else{
      cout<<-1<<endl;
    }
  }
  return 0;
}

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

int main(){
    int n;
    while(cin >> n, n != 0){
        set<int> info[102];
        for(int i=0;i<n;++i){
            int m;
            cin >> m;
            for(int j=0;j<m;++j){
                int p;
                cin >> p;
                info[i].insert(p);
            }
        }
        int k;
        cin >> k;
        vector<int> leaked;
        for(int i=0;i<k;++i){
            int l;
            cin >> l;
            leaked.push_back(l);
        }
        int cnt = 0, idx = -1;
        for(int i=0;i<n;++i){
            bool flag = true;
            for(int e : leaked){
                if(info[i].count(e) == 0)flag = false;
            }
            if(flag){
                cnt++;
                idx = i;
            }
        }
        if(cnt != 1 || idx == -1)cout << -1 << endl;
        else cout << idx + 1 << endl;
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}

int a[1000][1000];
int main(){
  while(1){
    int n;
    cin>>n;
    if(n==0) break;
    int b,d;
    lp(i,n+1){
      cin>>b;
      lp(j,b){
	cin>>d;
	a[i][d]=1;
      }
    }
    int count=0,ans,check;
    int c;
    cin>>c;
    int x[1000];
    lpin(x,i,c);
    lp(i,n){
      check=0;
      lp(j,c){
	if(a[i][x[j]]==1) 1;
	else check=1;
      }
      if(check==0){
	ans=i;
	count++;
      }
    }
    if(count==1) cout<<ans+1<<endl;
    else cout<<"-1"<<endl;
  }
  return 0;
}

C++: #include <set>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;

int main(){
	int x,n,m,k,i;
	for(;scanf("%d",&n),n;){
		vector<set<int> >v;
		for(i=0;i<n;i++){
			set<int>s;
			for(scanf("%d",&m),k=0;k<m;k++)scanf("%d",&x),s.insert(x);
			v.push_back(s);
		}
		set<int>t;
		for(scanf("%d",&k),m=0;m<k;m++)scanf("%d",&x),t.insert(x);
		vector<int>w;
		for(k=0;k<n;k++){
			set<int>s;
			set_intersection(v[k].begin(),v[k].end(),t.begin(),t.end(),inserter(s,s.end()));
			if(s.size()==t.size()){w.push_back(k);if(w.size()>1)break;}
		}
		printf("%d\n",w.size()==1?w[0]+1:-1);
	}
}

C++: #include <iostream>
#include <vector>

using namespace std;

void solve()
{
	int N;
	while(cin >> N, N)
	{
		bool info[101][101];
		for(int i = 0; i < 101; ++i)
		{
			for(int j = 0; j < 101; ++j)
			{
				info[i][j] = false;
			}
		}
		for(int i = 1; i <= N; ++i)
		{
			int M;
			cin >> M;
			for(int j = 0; j < M; ++j)
			{
				int p;
				cin >> p;
				info[i][p] = true;
			}
		}
		int K;
		cin >> K;
		vector<int> Vec(K);
		for(int i = 0; i < K; ++i)
		{
			cin >> Vec[i];
		}
		int alreadyFlag = 0;
		int ans = 0;
		for(int i = 1; i <= N; ++i)
		{
			bool flag = true;
			for(int j = 0; j < K; ++j)
			{
				if(!info[i][Vec[j]])
				{
					flag = false;
					break;
				}
			}
			if(flag)
			{
				++alreadyFlag;
				ans = i;
				if(alreadyFlag >= 2)
				{
					cout << -1 << endl;
					break;
				}
			}
		}
		if(alreadyFlag == 1)
		{
			cout << ans << endl;
		}
		else if(alreadyFlag == 0)
		{
			cout << -1 << endl;
		}
	}
}

int main()
{
	solve();
	return(0);
}