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<string>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)

const int MAXN = 101, MAXK = 101;

int n,m,k,t,p,l;
bool joho[MAXN][MAXN];
bool still[MAXN];

int main()
{
    while(cin >> n && n)
    {
        memset(still, true, sizeof(still));
        int ans = -1;
        int num = 0;
        for(int i=1;i<=n;i++)
        {
            cin >> t;
            rep(j,t)
            {
                cin >> p;
                joho[i][p] = true;
            }
        }

        cin >> k;
        rep(j,k)
        {
            cin >> l;
            for(int i = 1;i<=n;i++) still[i] = still[i] & joho[i][l];
        }

        for(int i=1;i<=n;i++)if(still[i])
        {
            ans = i;
            num++;
        }
        if(num>=2 || num == 0) {cout << -1 << endl; continue;}
        else cout << ans << endl;

C++: #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
using namespace std;
int main() {
	int n;
	while (cin >> n) {
		bool a[101][101];
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) a[i][j] = false;
		}
		for (int i = 1; i <= n; i++) {
			int m;
			cin >> m;
			for (int j = 0; j < m; j++) {
				int c;
				cin >> c;
				a[i][c] = true;
			}
		}
		int k;
		cin >> k;
		int b[101];
		for (int i = 0; i < k; i++) {
			cin >> b[i];
		}
		vector<int>d;
		for (int i = 1; i <= n; i++) {
			for (int j = 0; j < k; j++) {
				if (!a[i][b[j]]) {
					goto stop;
				}
			}
			d.push_back(i);
		stop:;
		}
		if (d.size() == 1) cout << d[0] << endl;
		else cout << -1 << endl;
	}
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>

using namespace std;

int main(void){
	
	int n,m;
	
	while(cin >> n,n){
		vector<int>v[101];
		for(int i=1;i<=n;i++){
			cin >> m;
			int a;
			for(int j=0;j<m;j++){
				cin >> a;
				v[i].push_back(a);
			}
		}
		int k;
		cin >> k;
		vector<int>l(k);
		for(int i=0;i<k;i++)cin >> l[i];
		
		int ans=0,id=0;
		for(int i=1;i<=n;i++){
			bool fg=true;
			if(v[i].size()==0)fg=false;
			for(int j=0;j<l.size();j++)
				if(!binary_search(v[i].begin(),v[i].end(),l[j]))fg=false;
			if(fg)ans++,id=i;
		}
		if(ans==1)cout << id << endl;
		else cout << -1 << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<utility>
#include<vector>
#include<set>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
typedef pair<int,int> pii;

int main(){
	int n,m,p,k;
	while(cin>>n,n){
		vector<vector<int> > vec;
		vector<int> data;
		rep(i,n){
			data.clear();
			cin>>m;
			rep(j,m){cin>>p;data.push_back(--p);}
			vec.push_back(data);
		}
		data.clear();
		cin>>k;
		int who[n];
		rep(i,n)who[i]=0;
		rep(i,k){
			cin>>m;
			rep(j,vec.size()){
				rep(l,vec[j].size()){
					if(vec[j][l]==m-1){
						who[j]++;
						break;
					}
				}
			}
		}
		int ans,check=0;
		rep(i,n){
			if(who[i]==k){
				ans=i+1;
				check++;
			}
		}
		if(check==1)cout<<ans<<endl;
		else cout<<-1<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main() {
  int n,i,j,c,q;
  while(cin>>n,n){
    int a[n+1][n]={0},k=0,p;
    for(i=0;i<=n;i++){
      for(cin>>a[i][0],j=1;j<=a[i][0];j++)cin>>a[i][j];
    }
  for(i=0;i<n;i++){
    for(q=j=1;j<=a[i][0];j++){
      if(a[n][q]==a[i][j])q++;
    }
    if(q-1==a[n][0]){
      k++;
      p=i+1;
    }
  }
  if(k==1)cout<<p<<endl;
  else cout<<-1<<endl;
  }
}

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

using namespace std;

int main(){
	int n;
	while(true){
		cin >> n;
		if(n==0){
			break;
		}

		set<int> s[100];
		
		for(int i=0;i<n;i++){
			int buf;
			cin >> buf;
			for(int j=0;j<buf;j++){
				int buf2;
				cin >> buf2;
				s[i].insert(buf2);
			}
		}

		int k;
		cin >> k;
		int kk[100];
		for(int i=0;i<k;i++){
			int buf;
			cin >> kk[i];
		}

		int ans = -1, cnt = 0;
		
		for(int i=0;i<n;i++){
			bool ansflag = true;
			for(int j=0;j<k;j++){
				ansflag &= s[i].count(kk[j]); 
			}
			if(ansflag) {
				ans = i+1;
				cnt++;
			}
		}
		if(cnt == 1 && ans != -1){
			cout << ans << endl;
		}else{
			cout << -1 << endl;
		}
		
	}
}

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

using namespace std;

int main() {
  
  int n;
  while(cin >> n, n) {
    vector<vector<int> > G(n, vector<int>(n, 0));
    for(int i=0; i<n; i++) {
      int m; cin >> m;
      for(int j=0; j<m; j++) {
	cin >> G[i][j];
      }
    }
    
    int k, data[100];
    cin >> k;
    for(int i=0; i<k; i++) {
      cin >> data[i];
    }
    
    int ans;
    int good = 0;
    for(int i=0; i<n; i++) {
      bool ok = true;
      for(int j=0; j<k; j++) {
	if(find(G[i].begin(), G[i].end(), data[j]) == G[i].end()) ok = false;
      }
      if(ok) { good ++; ans = i+1; }
    }
    if(good == 1) cout << ans << endl;
    else cout << -1 << endl;
  }
  
  return 0;
}