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>
using namespace std;


int main(){
    while (1){
    int m, n = 0;
    bool member[101][101] = {{false}}; // who knows who

    cin >> n;
    if (n == 0) break;
    for (int i = 0; i < n; i++){
	cin >> m;
	for (int j = 0; j < m; j++){
	    int tmp;
	    cin >> tmp;
	    member[i+1][tmp] = true;
	}
    }
    int k;
    cin >> k;
    int ohno[101] = {false};
    for (int i = 0; i < k; i++){
	int tmp;
	cin >> tmp;
	ohno[tmp] = true;
    }

    int many = 0;

    bool theOne = true;
    int mem;
    for (int i = 1; i <= n; i++){
	theOne = true;
	for (int j = 1; j < k; j++){
	    if (!(ohno[j] == true && member[i][j] == true)){ // i is not the one
		theOne = false;
	    }
	}
	if (theOne){
	    mem = i;
	    many++;
	}
    }

    if (many >= 2 || theOne != false) cout << -1 << endl;
    else cout << mem + 1 << endl;
}
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
const double PI = 3.14159265358979;
const double E = 2.718281828459045;
const double root2 = sqrt(2);
typedef pair<int, int> P;
typedef unsigned int ui;
int main() {
	int n, m, k, p, l;
	while (cin >> n) {
		if (n == 0)break;
		vector<int> s[101]; int cnt[101] = {};
		for (int i = 0; i < n; i++) {
			cin >> m;
			for (int j = 0; j < m; j++) {
				cin >> p; s[p].push_back(i+1);
			}
		}
		cin >> k;
		for (int i = 0; i < k; i++) {
			cin >> l;
			int len = s[l].size();
			for (int j = 0; j < len; j++) {
				cnt[s[l][j]]++;
			}
		}
		int ck = 0;
		for (int i = 1; i <= n; i++) {
			if (cnt[i] == k) {
				if (ck == 0) {
					ck = i;
				}
				else ck = -1;
			}
		}
		if (ck <= 0)cout << -1 << endl;
		else cout << ck << endl;
	}
	return 0;
}

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

#define INF 999999999
#define mod 1000000007

#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define MOD(x) (x%(mod))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;

/*---------------------------------------------------*/

int solve(int n,vi v[],int k,int name[]){
  int find_name=-1,cnt;
  bool find=false;
  rep(i,n){
    cnt=0;
    rep(j,v[i].size()){
      rep(l,k){
	if(v[i][j]==name[l])cnt++;
      }
    }
    if(find&&cnt==k)return -1;
    if(cnt==k){
      find_name=i+1;
      find=true;
    }
  }
  return find_name;
}

int main(){
  int n,m,a,name[100];
  while(cin>>n){
    if(n==0)break;
    vector<int>v[n];
    rep(i,n){cin>>m;rep(j,m){cin>>a;v[i].pb(a);}}
    int k;
    cin>>k;
    rep(i,k)cin>>name[i];
    cout<<solve(n,v,k,name)<<endl;
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int n,cnt;
int m[101],p[101][101];
int k,l[101];
int main(){
  while(cin>>n&&n!=0){
    int ans=0;
    cnt=0;
    for(int i=0;i<n;i++){
      cin>>m[i];
      for(int j=0;j<m[i];j++){
        cin>>p[i][j];
      }
      sort(p[i],p[i]+m[i]);
    }
    cin>>k;
    for(int i=0;i<k;i++){
      cin>>l[i];
    }
    sort(l,l+k);
    for(int i=0;i<n;i++){
      int cp=0;
      for(int j=0;j<m[i];j++){
        if(cp==k)break;
        if(l[cp]==p[i][j]){
          cp++;
        }
      }
      if(cp==k){
          cnt++;
          ans=i;
      }
    }
    if(cnt!=1)cout<<-1<<endl;
    else cout<<ans+1<<endl;
  }
}

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

using namespace std;
 
int main(){
    int n,a,b;
 
    while(cin >> n ,n){
	vector<int> v[n];
	for(int i = 0 ; i < n ; i++){
	    cin >> a;
	    for(int j = 0 ; j < a ; j++){
		cin >> b;
		v[i].push_back(b);
	    }
	}
	int check[101] = {0};
	int cnt[101] = {0};
	int ans;
 
	cin >> a;
	for(int i = 0 ; i < a ; i++){
	    cin >> check[i];
	}
	int t = 0;
	while(true){
	    if(t == n) break;
       
	    for(int i = 0 ; i < a ; i++){
		vector<int>::iterator pos;
		pos = find(v[t].begin(),v[t].end(),check[i]);
		if(pos == v[t].end()){
		    break;
		}
		else{
		    cnt[t]++;
		}
	    }
	    t++; 
	}
 
	int cnt1 = 0;
	for(int i = 0 ; i < n ; i++){
	    if(cnt[i] == a){
		ans = i+1;
		cnt1++;
	    }
 
	}
	if(cnt1 == 1) cout << ans << endl;
	else cout << "-1" << endl;   
    }
    return 0;
}