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 <cmath>
#include <ctime>
#include <climits>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <cstring>
#include <tuple>
#include <bitset>
#include <unordered_map>
using namespace std;
typedef long long ll;

int main() {
    ios::sync_with_stdio(false);

    while (1) {
        int N;
        cin >> N;

        if (N == 0) {
            break;
        }

        // 誰が誰の個人情報を知っているか
        bitset<101> has_privacy[100];

        for (int i=0; i<N; ++i) {
            int M;
            cin >> M;
            for (int j=0; j<M; ++j) {
                int p;
                cin >> p;
                has_privacy[i].set(p, 1);
            }
        }

        int K;
        cin >> K;

        bitset<101> leaked_list;
        for (int i=0; i<K; ++i) {
            int l;
            cin >> l;
            leaked_list.set(l, 1);
        }

        int ans = -1;
        for (int i=0; i<N; ++i) {
            if ((has_privacy[i] & leaked_list) == leaked_list) {
                if (ans == -1) {
                    ans = i + 1;
                } else {
                    ans = -1;
                    break;
                }
            }
        }

        cout << ans << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
#include <string>
using namespace std;
string IntToString(int);
int StringToInt(string);
int main(){
  while(1){
    int n;
    cin >> n;
    if(n == 0)break;
    vector<int> M(n);
    vector<unsigned int> P(n,0);
    for(int i = 0;i < n;i++){
      cin >> M[i];
      for(int j = 0;j < M[i];j++){
	unsigned int tmp;
	cin >> tmp;
	P[i] = (P[i] | (1 << (tmp-1)));
      }
    }
    int more_n;
    cin >> more_n;
    unsigned int more = 0;
    for(int i = 0;i < more_n;i++){
      int tmp;
      cin >> tmp;
      more = (more | (1 << (tmp-1)));
    }
    int flag = 0;
    int ans;
    for(int i = 0;i < n;i++){
      if((P[i] & more) == more){
	ans = i+1;
	flag++;
      }
    }
    if(flag == 1)cout << ans << endl;
    else cout << "-1" << endl;
    
  }
  return 0;   
}
string IntToString(int number){
  stringstream ss;
  ss << number;
  return ss.str();
}
int StringToInt(string number){
  stringstream ss;
  ss << number;
  int numInt;
  ss >> numInt;
  return numInt;
  
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
	while(1){
		int n,p[100][100];
		cin >> n;
		if(n==0) break;
		int m[n];
		for(int i=0;i<n;i++){
			cin >> m[i];
			for(int j=0;j<m[i];j++){
				cin >> p[i][j];
			}
		}
		int k,kensu=0,han,nin=0;
		cin >> k;
		int l[k];
		for(int i=0;i<k;i++){
			cin >> l[i];
		}
		for(int i=0;i<n;i++){
			kensu=0;
			for(int j=0;j<m[i];j++){
				for(int m=0;m<k;m++){
					if(p[i][j]==l[m]){
						kensu++;
					}
				}
				if(kensu==k){
					han=j;
					nin++;
				}
			}
		}
		if(nin==1){
			cout << han << endl;
		}else{
			cout << -1 << endl;
		}
	}
}

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

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define between(a,x,b) ((a)<=(x)&&(x)<=(b))
using namespace std;
int data[101][101], ks;
vector<int>k;
vector<int>m;
bool judge(int x){
  int j;
  rep(i, ks){
    for(j = 0; j < m[x]; ++j) if(k[i] == data[x][j]) break;
    if(j == m[x]) return false;
  }
  return true;
}

int main(){
  int n, in;
  while(scanf("%d", &n) && n){
    k.clear(); m.clear();
    rep(i, n){
      scanf("%d", &in);
      m.push_back(in);
      rep(j, m[i]) scanf("%d", &data[i][j]);
      sort(data[i], data[i]+m[i]);
    }
    //    printf("member");
    scanf("%d", &ks);
    rep(i, ks){ scanf("%d", &in); k.push_back(in);}
    sort(k.begin(), k.end());
    int f = 0, res;
    rep(i, n)
      if(judge(i)){ f++; res = i;}
    /*    rep(i, n){
      rep(j, m[i]) printf("%d ", data[i][j]);
      puts("");
    }
    printf("%d %d\n", f, res);
    rep(i, ks) printf("%d ", k[i]);
    puts(""); */    
    if(f == 1) printf("%d\n", res+1);
    else puts("-1");
    //    puts("end");
  }
  return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)

const int MAXN = 101, MAXK = 101;

int n,m,k,t,p,l;
bool joho[MAXN][MAXN];
bool still[MAXN];

int main()
{
    while(cin >> n && n)
    {
        memset(still, true, sizeof(still));
        memset(joho, false, sizeof(joho));
        int ans = -1;
        int num = 0;
        for(int i=1;i<=n;i++)
        {
            cin >> t;
            rep(j,t)
            {
                cin >> p;
                joho[i][p] = true;
            }
        }

        cin >> k;
        rep(j,k)
        {
            cin >> l;
            for(int i = 1;i<=n;i++) still[i] = still[i] & joho[i][l];
        }

        for(int i=1;i<=n;i++)if(still[i])
        {
            ans = i;
            num++;
        }
        if(num>=2 || num == 0) {cout << -1 << endl; continue;}
        else cout << ans << endl;

    }

    return 0;
}