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;

int main() {

    int n;

    while(cin >> n, n) {

        int m, k, temp;
        vector<int> p[n], l, suspect;

        for(int i = 0; i < n; ++i) {
            cin >> m;
            for(int j = 0; j < m; ++j) {
                cin >> temp;
                p[i].push_back(temp);
            }
        }

        cin >> k;
        for(int i = 0; i < k; ++i) {
            cin >> temp;
            l.push_back(temp);
        }

        for(int i = 0; i < n; ++i) {

            bool is_suspect = true;

            for(int j = 0; j < k; ++j) {
                if(find(p[i].begin(), p[i].end(), l[j]) == p[i].end()) {
                    is_suspect = false;
                }
            }

            if(is_suspect) {
                suspect.push_back(i + 1);
            }

        }

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

    }

}

C++: #include <iostream>
#include <vector>
#include <bitset>

using namespace std;
typedef bitset<128> bset;

int main(){
	while(true){
		int N;
		cin >> N;
		if(N == 0){ break; }
		vector<bset> m(N);
		for(int i = 0; i < N; ++i){
			int M;
			cin >> M;
			while(M--){
				int p;
				cin >> p;
				m[i][--p] = true;
			}
		}
		int K;
		bset l;
		cin >> K;
		while(K--){
			int p;
			cin >> p;
			l[--p] = true;
		}
		int answer = -1, count = 0;
		for(int i = 0; i < N; ++i){
			if((m[i] & l) == l){
				answer = i + 1;
				++count;
			}
		}
		if(count >= 2){ answer = -1; }
		cout << answer << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    while(true){
        int N;
        cin >> N;
        if(N == 0)
            break;
        vector<int> data(N*N, 101);
        
        for(int i = 0; i < N; i++){
            int M;
            cin >> M;
            vector<int> xs(M, 101);
            
            for(int j = 0; j < M; j++){
                int p;
                cin >> p;
                xs[j] = p;
            }
            sort( xs.begin(), xs.end() );
            for(int j = 0; j < M; j++){
                data[i*N+j] = xs[j];
            }
        }
        
        int K;
        cin >> K;
        vector<int> leak(K);
        for(int i = 0; i < K; i++){
            int l;
            cin >> l;
            leak[i] = l;
        }
        
        sort( leak.begin(), leak.end() );
        int ans = -1;
        for(int i = 0; i < N; i++){
            bool flag1 = true;
            int t = 0;
            for(int j = 0; j < K; j++){
                bool flag2 = false;
                while(true){
                    if(data[i*N+t] < leak[j]){
                        t += 1;
                    }
                    else if(data[i*N+t] == leak[j]){
                        t += 1;
                        break;
                    }
                    else{
                        flag2 = true;
                        break;
                    }
                }
                if(flag2){
                    flag1 = false;
                    break;
                }
            }
            if(flag1){
                if(ans == -1){
                    ans = i + 1;
                }
                else{
                    ans = -1;
                    break;
                }
            }
        }
        
        cout << ans <<endl;
        
    }
}

C++: #include<iostream>
#include<vector>
using namespace std;
bool comp[101][101];
int main(){
  int n;
  while(cin>>n,n){
    int num;
    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 cnt=0;
    int ans;
    bool flag = false;
    for(int i=0;i<n;i++){
      while(cnt < num && comp[i][list[cnt]-1]==true)cnt++;
      if(cnt==num){
	if(flag == true){
	  flag=false;
	  break;
	}
	flag=true;
	ans = i+1;
      }
      cnt=0;
    }
    if(flag==true){
      cout << ans << endl;
    }else{
      cout << -1 << endl;
    }
  }
  return 0;
}

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

int main(){

  int n;

  while(cin>>n, n){
    int m[100], p[100][100], k, l[100], c=0, x;
    for(int i=0;i<n;i++){
      cin>>m[i];
      for(int j=0;j<m[i];j++) cin>>p[i][j];
    }
    cin>>k;
    for(int j=0;j<k;j++) cin>>l[j];
    for(int i=0;i<n;i++){
      if(m[i]<k) continue;
      int j;
      for(j=0;j<k;j++){
        int h;
        for(h=0;h<m[i];h++){
          if(l[j]==p[i][h]){
            //cout<<l[j]<<endl;
            break;
          }
        }
        if(h==m[i]) break;
      }
      if(j==k){
        c++;
        x=i;
      }
    }
    if(c==1) cout<<x+1<<endl;
    else cout<<-1<<endl;
  }

  return 0;
}