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<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#define INF 2147483647
#define lli long long int

using namespace std;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;

void printv(vvi v){
	for(int i = 0; i < v.size(); i++){
		for (int j = 0; j < v.size(); j++){
			cout << v[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
	return ;
}

int check_func(vvi adj,vi &check,int k){
	for (int i = 0; i < k; i++){
		int l; cin >> l;
		for (int j = 0; j < check.size(); j++){
			check[j] *= adj[j][l-1];
		}
	}

	int sum = 0;
	int ret;
	for (int i = 0; i < check.size(); i++){
		if (check[i]){
			sum++;
			ret = i;
		}
	}
	if (sum == 1){
		return ret + 1;
	}else{
		return -1;
	}
}
int main() {
	while(1){
		int ans = 0;
		int n ; cin >> n;
		if (n == 0) break;
		
		vvi adj(n,(vi(n,0)));	

		for (int i = 0; i < n; i++){
			int m; cin >> m;
			for (int j = 0; j < m; j++){
				int p; cin >> p;
				adj[i][p-1] = 1;
			}
		}
		//printv(adj);

		int k; cin >> k;
		vi check(n,1);
		ans = check_func(adj,check,k);
		cout << ans << endl;

	}

	return 0;
}

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

int main(){
  int N,K,ans;
  int p[100][100];
  int l[100];

  while(true){
    cin >> N;
    if(N == 0) break;

    int *M = new int[N];
    
    for(int i=0;i<N;++i){
      cin >> M[i];

    
      for(int ix=0;ix<M[i];++ix){
	cin >> p[i][ix];
      }
    }
    
    cin >> K;
    
    for(int i=0;i<K;++i)
      cin >> l[i];
    
    
    int cnt = 0;
    for(int i=0;i<N;++i){
      if(K>M[i]) break;
      if(M[i] == 0) continue;
      
      bool w = true;
      for(int k=0;k<K;++k){
	for(int ix = 0; ix<M[i]; ++ix){
	  if(l[k] == p[i][ix]){
	    break;
	  }
	  if(ix == M[i] - 1) w = false;
	}
	if(!w) break;
      }
      
      if(w) {
	++cnt;
	ans = i;

      }
    }

    if(cnt == 1){
      cout << ans + 1 << endl;
    }else{
      cout << -1 << endl;
    }

    delete[] M;

  }
  
  return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int d[101][101];
int know[101];
int main(){
	int n;
	while(cin>>n,n){
		for(int i = 0;i <=n;i++){
			for(int j = 0;j <=n;j++){
				d[i][j] =0;
			}
		}
		for(int i = 1;i <=n;i++){
			int m;
			cin>>m;
			for(int j = 0;j < m;j++){
				int k;
				cin>>k;
				d[i][k] = 1;
			}
		}
		int k;//流失した数
		cin>>k;
		vector<int> ans;
		ans.clear();
		for(int i = 0;i <k;i++){
			cin>>know[i];//流失した番号
		}
		for(int j = 1;j <=n;j++){
			bool flag = true;
			for(int i = 0;i <k;i++){
				if(d[j][know[i]]==1){
					continue;
				}
				flag =false;
			}
			if(flag){
				ans.push_back(j);
			}
		}
		if(ans.size()==1){
			cout <<ans.front()<<endl;
		}else{
			cout <<-1<<endl;
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int N;
    while (cin >> N, N) {
        vector<set<int>> s(N);
        rep(i, N) {
            int m;
            cin >> m;
            rep(j, m) {
                int p;
                cin >> p;
                s[i].insert(p);
            }
        }

        int K;
        cin >> K;
        vector<bool> b(N, true);
        rep(k, K) {
            int l;
            cin >> l;
            rep(i, N) {
                if (s[i].count(l) == 0) b[i] = false;
            }
        }

        int cnt = 0;
        int ans = -1;
        rep(i, N) {
            if (b[i]) {
                cnt++;
                ans = i + 1;
            }
        }

        if (cnt != 1) ans = -1;
        cout << ans << endl;
    }

}