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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int solve(int n) {
    vector<vector<int>> know(n);
    for (int i = 0; i < n; i++) {
        vector<int> &cur = know[i];
        int m; cin >> m; cur.resize(m);
        for (int j = 0; j < m; j++) {
            cin >> cur[j]; cur[j]--;
        }
    }
    int k; cin >> k;
    vector<int> subject(k);
    for (int i = 0; i < k; i++) {
        cin >> subject[i]; subject[i]--;
    }
    int cnt = 0, ans = -1;
    for (int i = 0; i < n; i++) {
        bool flag = true;
        for (int& k : subject) {
            flag &= find(know[i].begin(), know[i].end(), k) != know[i].end();
        }
        if (flag) {
            cnt++;
            ans = i + 1;
        }
    }
    if (cnt == 1) return ans;
    else return -1;
}

int main() {
    int n;
    while (cin >> n, n) {
        cout << solve(n) << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
bool comp[101][101];
int main(){
  int n;
  int num;
  while(cin>>n,n){
    
    for(int i=0;i<n;i++){
      cin>>num;
      for(int j=0;j<num;j++){
	int tmp; cin>>tmp;
	comp[i][tmp-1]=true;
      }
    }

    cin>>num;
    int list[num];
    for(int i=0;i<num;i++)cin>>list[i];

    int ans=-1;
    int flag=0;
    for(int i=0;i<n;i++){
      for(int j=0;j<num;j++){
	//cout << "list["<<j<<"] = "<< list[j]-1<< endl;
	if(comp[i][list[j]-1]==false)break;
	if(j==num-1){
	  if(flag==0){
	    ans=i+1;
	    flag++;
	  }else if(flag==1){
	    ans=-1;
	    flag++;
	  }
	}
      }
      if(flag==2)break;
    }
    cout << ans << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
int main() {
	int n;
	while (cin >> n, n) {
		bool b[114][514] = {};
		for (int i = 1; i <= n; i++) {
			int k; cin >> k;
			for (int j = 0; j < k; j++) { int q; cin >> q; b[i][q] = true; }
		}
		vector<int>v;
		int k; cin >> k;
		for (int i = 0; i < k; i++) { int p; cin >> p; v.push_back(p); }
		int ans = -1;
		for (int i = 1; i <= n; i++) {
			for (int j = 0; j < v.size(); j++)
				if (!b[i][v[j]])goto cont;
			if (ans == -1)ans = i;
			else { cout << "-1\n"; goto end; }
			cont:;
		}
		cout << ans << endl;
	end:;
	}
}

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

typedef vector<int> vi;
typedef vector<vi> vvi;

#define loop(i,a,b) for(int i=(a); i<int(b); i++)
#define rep(i,b) loop(i,0,b)

ostream& operator<<(ostream& os, vi const& v){
  rep(i,v.size()){
    os << v[i] << " ";
  }
  return os;
}

int main(){
  int n;
  while(cin >> n,n){

    vector<set<int>> vs(n);
    rep(i,n){
      int k; cin>>k;
      rep(j,k){
	int t;
	cin >> t; t--;
	vs[i].insert(t);
      }
      // cout << vs[i] << endl;
    }

    int k; cin >> k;
    vi s(k);
    rep(i,k){
      int x; cin >> x;
      x--;
      s[i] = x;
    }
  
    vi ans;
    rep(i,n){
      bool ok = true;
      rep(j,k){
	if(vs[i].count(s[j])==1) continue;
	ok = false;
	break;
      }
      if(ok) ans.push_back(i);
    }

    if(ans.size()==1){
      cout << ans[0]+1 << endl;
    } else {
      cout << -1 << endl;
    }
  }
  
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<cstring>
#include<utility>
#include<set>
#include<stack>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int>PI;
using namespace std;
#define MAX  999999
int main(){
    int n;
    while(cin>> n,n){
        vi array(1000,0); bool check = false; int ans = 0; int hoge = -INF;;
        vi num(1000,0); vi size(1000,0);
        vi z;
        vvi v(1000,vi(1000,0));
        rep(i,n){cin >> size[i]; rep(j,size[i])cin >> v[i][j];}
        int temp; cin>>temp; vi u(temp+1,0);
        rep(i,temp) cin >> u[i];
        rep(i,n){
            rep(j,v[i].size()){
                rep(k,temp){
                    if(v[i][j] == u[k]){array[i]++; num[u[k]]+=1;}
                }
            }
            if(hoge < array[i]){hoge = array[i];ans = i;}
        }
    
        /*judgement all element*/
        rep(i,size[ans]){
            if(v[ans][i]!= 0){
                //cout << v[ans][i]; cout << endl;
                //cout << num[v[ans][i]]; cout << endl;
                if(num[v[ans][i]] == 1){check = true;}
            }
        }
        if(hoge != temp) check = false;
        if(check == true) cout << ans+1 << endl;
        else  cout << -1 << endl;
    }
}