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 <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;

int main()
{
  int n,m,k;
  while(true)
    {
      cin>>n;
      if(n==0)
	exit(0);
      vector<int> p[101];
      vector<int> kk;    
      for(int j=0;j<n;j++)
	{
	  cin>>m;
	  for(int i=0;i<m;i++)
	    {
	      int t;
	      cin >>t;
	      p[j].push_back(t);
	    }
	}
      cin>>k;
      for(int i=0;i<k;i++)
	{
	      int t;
	      cin >> t;
	      kk.push_back(t);
	}
  
      int ans=-1;
      bool ans_s=false;
      for(int i=0;i<n;i++)
	{
	  int count=0;
	  for(int j=0;j<kk.size();j++)
	    {
	      for(int x=0;x<p[i].size();x++)
		{
		  if(p[i][x]==kk[j])
		    {
		   
		      count++;
		      break;
		    }
		}
	    }
	  if(count==kk.size())
	    {
	      if(ans_s==true)
		ans=-1;
	      else
		{
		  ans=i+1;
		  ans_s=true;
		}
	    }
	}
      cout<<ans<<endl;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <cmath>
#include <algorithm>
#include <map>
#include <list>
#include <cstdlib>

using namespace std;

typedef pair<int, int> P;

#define MAX 128

int main()
{
	while(1) {
		int n;
		bool know[MAX][MAX] = {false};
		bool leak[MAX];

		for(int i = 0; i < MAX; i++) {
			leak[i] = true;
		}
		
		scanf("%d", &n);
		if(!n) break;
		for(int i = 1; i <= n; i++) {
			int m;
			scanf("%d", &m);
			while(m--) {
				int p;
				scanf("%d", &p);
				know[i][p] = true;
			}
		}

		int k;
		scanf("%d", &k);
		while(k--) {
			int l;
			scanf("%d", &l);
			for(int i = 1; i <= n; i++) {
				if(!leak[i]) continue;
				if(!know[i][l]) {
					leak[i] = false;
				}
			}
		}

		int ans = -1;
		for(int i = 1; i <= n; i++) {
			if(!leak[i]) continue;
			if(ans > 0) {
				ans = -1;
				break;
			}
			ans = i;
		}
		printf("%d\n", ans);
	}
	return 0;
}

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

const int MAX_N=101;

int N,M,K,p,l;
vector<set<int>> know(MAX_N);
vector<int> victim(MAX_N),ans;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    while(cin >> N,N){
        ans.clear();
        for (int i=0;i<N;++i){
            cin >> M; know[i].clear();
            for (int j=0;j<M;++j){
                cin >> p; know[i].insert(p);
            }
        }
        cin >> K;
        for (int i=0;i<K;++i) cin >> victim[i];
        for (int i=0;i<N;++i){
            for (int j=0;j<K;++j){
                if (!know[i].count(victim[j])){
                    break;
                    cout << i+1 << ' ' << victim[j] << endl;
                }
                if (j==K-1) ans.emplace_back(i+1);
            }
        }
        cout << (ans.size()==1?ans[0]:-1) << '\n';
    }
}

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

using namespace std;

int main(void) {
	int i, j;
	int n;

	while (cin >> n, n) {
		int m[100], k;
		set<int> s1[100], s2;

		for (i = 0; i < n; i++) {
			cin >> m[i];
			for (j = 0; j < m[i]; j++) {
				int p;
				cin >> p;
				s1[i].insert(p);
			}
		}
		cin >> k;
		for (i = 0; i < k; i++) {
			int k;
			cin >> k;
			s2.insert(k);
		}

		vector<int> ans;
		for (i = 0; i < n; i++) {
			vector<int> v(100);
			const int cnt = set_intersection(s1[i].begin(), s1[i].end(), s2.begin(), s2.end(), v.begin()) - v.begin();
			if (cnt == k)
				ans.push_back(i + 1);
		}
		if (ans.size() == 1)
			cout << ans[0] << endl;
		else
			cout << -1 << endl;
	}

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
  while (1){
    int N;
    cin >> N;
    if (N == 0){
      break;
    }
    vector<vector<bool>> L(N, vector<bool>(N, false));
    for (int i = 0; i < N; i++){
      int M;
      cin >> M;
      for (int j = 0; j < M; j++){
        int p;
        cin >> p;
        p--;
        L[i][p] = true;
      }
    }
    vector<bool> L2(N, false);
    int K;
    cin >> K;
    for (int i = 0; i < K; i++){
      int l;
      cin >> l;
      l--;
      L2[l] = true;
    }
    vector<int> ans;
    for (int i = 0; i < N; i++){
      bool ok = true;
      for (int j = 0; j < N; j++){
        if (!L[i][j] && L2[j]){
          ok = false;
        }
      }
      if (ok){
        ans.push_back(i);
      }
    }
    if (ans.size() == 1){
      cout << ans[0] + 1 << endl;
    } else {
      cout << -1 << endl;
    }
  }
}