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>

#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define INF 1e9

using namespace std;
int coin[4] = {10, 50, 100, 500};

int main(){
  int n;
  while(cin >> n and n) {
    set<int> know[n];
    vector<int> known;
    REP(i, n){
      int x; cin >> x;
      REP(j, x) { int tmp; cin >> tmp; know[i].insert(tmp); }
    }
    int k; cin >> k;
    REP(i, k){
      int tmp; cin >> tmp;
      known.push_back(tmp);
    }
    int res = -1;
    REP(i, n){
      bool target = true;
      REP(j, known.size()){
        if(know[i].find(known[j]) == know[i].end()) target = false;
        if(target == false) break;
      }
      if(target and res != -1) { res = -1; break; }
      if(target) res = i+1;
    }
    cout << res << endl;
  }
}

C++: #include <bits/stdc++.h>

using namespace std;

int main()
{
    while (true) {
        int n;
        cin >> n;
        if (n == 0) {
            break;
        }
        vector<vector<bool>> info(n, vector<bool>(n, false));
        for (int i = 0; i < n; i++) {
            int m;
            cin >> m;
            info[i].resize(m);
            for (int j = 0; j < m; j++) {
                int in;
                cin >> in;
                in--;
                info[i][in] = true;
            }
        }
        int k;
        cin >> k;
        vector<int> leak(k);
        for (int i = 0; i < k; i++) {
            int l;
            cin >> l;
            l--;
            leak[i] = l;
        }

        int suspect = -1;
        for (int i = 0; i < n; i++) {
            int rest = k;
            for (int j = 0; j < k; j++) {
                if (info[i][leak[j]]) {
                    rest--;
                }
            }
            if (rest == 0) {
                if (suspect == -1) {
                    suspect = i + 1;
                } else {
                    suspect = -2;
                }
            }
        }
        if (suspect < 0) {
            cout << -1 << endl;
        } else {
            cout << suspect << endl;
        }
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
 
typedef long long ll;
typedef pair<int, int> ii;


struct NODE{
	int num;//team number
	vector<int> wrong;
	ll score;
	int solve;
	NODE(){}
	NODE(int num, int p):num(num), wrong(p, 0){score = 0; solve = 0;}
	
	bool operator<(const NODE r){
		if(solve != r.solve) return solve < r.solve;
		else if (score != r.score) return score > r.score;
		else return num > r.num;
	}
};

int main() {
	
	int n;
	while(cin >> n, n){
		
		vector<vector<int>> p(n);
		rep(i, n){
			int m;
			cin >> m;
			p[i].resize(m);
			rep(j, m){
				cin >> p[i][j];
			}
		}
		
		int k;
		cin >> k;
		vector<int> l(k);
		rep(i, k) cin >> l[i];
		
		int cnt = 0;
		int num;
		rep(i, n){
			bool flag = true;
			rep(j, k){
				if(find(p[i].begin(), p[i].end(), l[j]) == p[i].end()) flag = false;
			}
			if(flag){
				cnt++;
				num = i+1;
			}
		}
		
		
		if(cnt != 1) cout << -1 << endl;
		else cout << num << endl;
	}
	
	return 0;
}

C++: #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;


using namespace std;

int main()
{

  while(1){

    int n;
    cin >> n;

    if(n==0) break;

    vector<vector <int> > data;

    rep(i,n){
      int m;
      vector<int> tmp;
      cin >> m;
      rep(j,m){
        int p;
        cin >> p;
        tmp.push_back(p);
      }
      data.push_back(tmp);
    }

    int k,l;
    vector<int> k_data;
    cin >>k;
    rep(i,k){
      cin >> l;
      k_data.push_back(l);
    }

    rep(i,n){
      sort(data[i].begin(),data[i].end());
    }
    sort(k_data.begin(),k_data.end());

    bool flag[n];
    rep(i,n){
      flag[i]=true; 
      if(data[i].size()==0){flag[i]=false; continue;}
      rep(j,k_data.size()){
        int a = lower_bound(data[i].begin(),data[i].end(),k_data[j])-data[i].begin();
        if(data[i][a]!=k_data[j]){ flag[i]=false;break;}
      }
    }
    int count=0;
    rep(i,n){ if(flag[i]) count++;}


    if(count==1){
      rep(i,n){ if(flag[i]) cout << i+1 << endl;continue;}
    }else{
      cout << -1 << endl;
    } 
  }
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;

int main(){

int N;
while(1){
cin>>N;
int M;
bool n[101][101]={};
for(int i=1;i<=N;i++){
cin>>M;
for(int j=0;j<M;j++)
{int x;cin>>x;n[i][x]=true;}
}

bool R[101]={};
cin>>M;
for(int i=0;i<M;i++)
{int x;cin>>x;R[x]=true;}
int c=0,k=0;

for(int i=1;i<=N;i++){bool f=true;
for(int j=1;j<=N;j++)
{
if(n[i][j]!=R[j]&&R[j]==true)f=false;
}
if(f==true){c++;k=i;}
}

if(c==1)cout<<k<<endl;
else{cout<<"-1"<<endl;}
}
return 0;
}