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>

using namespace std;

#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for(int i = (int)(n - 1); i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SQ(n) (n) * (n)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vc> vvc;
typedef vector<vll> vvll;

int main() {
  int n;
  while(cin >> n, n) {
    bitset<128> know[128];
    bitset<128> leak;
    REP(i, n){
      int m;
      cin >> m;
      REP(j, m){
        int p;
        cin >> p;
        know[i][--p] = 1;
      }
    }
    int k;
    cin >> k;
    REP(i, k) {
      int l;
      cin >> l;
      leak[--l] = true;
    }

    int res = -1;
    REP(i, n){
      if ((know[i] & leak) == leak) {
        if (res != -1) {
          res = -1;
          break;
        }
        res = i + 1;
      }
    }
    cout << res << endl;
  }
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <complex>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
const int INF = 1<<28;

int main() {
	int n;
	while(cin >> n, n) {
		//int f[101][101] = {};
    vector< vector<int> > f(n);
		// FOR(i, 1, n+1) {
    REP(i, f.size()) {
			int m; cin >> m;
      f[i] = vector<int>(m);
			REP(j, m)
				cin >> f[i][j];
		}
		int k; cin >> k;
		int l[k], cnt, ans = 0;
		REP(i, k)
			cin >> l[i];
		REP(i, n) {
			cnt = 0;
      REP(j, f[i].size()) {
			//FOR(j, 1, n+1) {
				if(f[i][j] == l[cnt])
					cnt++; 
				if(cnt == k) {
					if(!ans) ans = i + 1;
					else ans = -1;
					break;
				}
			}
		}
		if(ans == 0) ans = -1;
		cout << ans << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int main(){
  int T;
  bool know[101][101];
  bool known[101];
  
  while(cin >> T && T){
    memset(know, false, sizeof(know));
    memset(known, true, sizeof(known));
    
    int n, k;
    
    for(int i = 1 ; i <= T ; i++){
      cin >> n;
      for(int j = 0 ; j < n ; j++){
	cin >> k;
	know[i][k] = true;
      }
    }
    
    cin >> n;
    for(int i = 0 ; i < n ; i++){
      cin >> k;
      for(int i = 1 ; i <= T ; i++) known[i] = known[i] & know[i][k];
    }
    
    int ans = -1;
    int num = 0;
    for(int i = 1 ; i <= T ; i++){
      if(known[i]){
	ans = i;
	num++;
      }
    }
    
    if(num >= 2 || num == 0) cout << -1 << endl;
    else cout << ans << endl;
  } 
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int N;
  int a,b;
  int r[100];
  int s[100];
  int p[100][100];
  int sum;
  bool c=false;
  while(1){
    c=false;
    for(int i=0;i<100;i++){
      for(int j=0;j<100;j++){
	p[i][j]=0;
      }
    }
    cin>>N;
    if(N==0) break;
    for(int i=0;i<N;i++){
      cin>>a;
      if(a==0) continue;
      for(int j=0;j<a;j++){
	cin>>b;
	p[i][b-1]=1;
      }
    }
    for(int i=0;i<N;i++){
      sum=0;
      for(int j=0;j<N;j++){
	sum+=p[j][i];
      }
      r[i]=sum;
    }
    cin>>a;
    for(int i=0;i<a;i++){
      cin>>b;
      if(r[b-1]==1){
	for(int j=0;j<N;j++){
	  if(c==true) break;
	  if(p[j][b-1]==1){
	    cout<<j+1<<endl;
	    c=true;
	    break;
	  }
	}
      }
    }
    if(c==false) cout<<-1<<endl;
    /*for(int i=0;i<N;i++){
      for(int j=0;j<N;j++){
	cout<<p[i][j];
      }
      cout<<endl;
      }*/
    }
  return 0;
}

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

int main(void){


    while(1){
        int n; cin >> n;
        if(n == 0) break;
        vector<set<int> > people(n);
        for(int i = 0; i < n; i++){
                int m; cin >> m;
            for(int j = 0; j < m; j++){
                int input; cin >> input;
                people[i].insert(input);
            }
        }

        int k; cin >> k;
        vector<bool> criminal(n, false);
        vector<int> a(k);
        for(int i = 0; i < k; i++){
            cin >> a[i];
        }

        for(int i = 0; i < n; i++){
            bool flag = false;
            for(int j = 0; j < k; j++){
                if(people[i].find(a[j]) == people[i].end()){
                    flag = true;
                    break;
                }
            }
            if(!flag) criminal[i] = true;
        }   

        int ans = 0;
        for(int i = 1; i <= n; i++){
            if(criminal[i-1] == true){
                if(ans == 0) ans = i;
                else ans = -1;
            }
        }

        if(ans == 0) ans = -1;

        cout << ans << endl;


    }
    return 0;
}