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>

#define all(x) (x).begin(), (x).end()

using namespace std;

int main(){

    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    int m;
    int k;
    int cnt;
    int ans;
    vector< vector<int> > p;
    vector<int> l;

    while(cin >> n, n){

        p.resize(n);

        for (auto &x : p){

            cin >> m;
            x.resize(m);

            for (auto &y : x)
                cin >> y;

        }


        cin >> k;
        l.resize(k);

        for(auto &x : l)
            cin >> x;

        sort(all(l));

        cnt = 0;
        ans = 0;

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

            sort(all(p[i]));

            if(includes(all(p[i]), all(l))){
                cnt++;
                ans = i + 1;
            }

        }

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

    }

    return 0;

}

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

int main() {

  while( true ) {

    long long int n;
    cin >> n;
    if ( n == 0 ) break;

    vector< long long int > v0, v1;

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

      long long int m;
      cin >> m;

      long long int p0 = 0;
      long long int p1 = 0;

      for ( long long int i = 0; i < m; i++ ) {

	long long int in;
	cin >> in;
	if ( in < 50 ) {
	  p0 += ( 1 << in );
	}else {
	  p1 += ( 1 << ( in - 50 ) );
	}

      }

      v0.push_back( p0 );
      v1.push_back( p1 );

    }

    long long int ans = -1;

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

      if ( ( v0[i] & v0[n] ) == v0[n] && ( v1[i] & v1[n] ) == v1[n] ) {

	if ( ans == -1 ) {
	  ans = i + 1;
	}else {
	  ans = -1;
	  break;
	}

      }

    }

    cout << ans << endl;

  }

  return 0;

}

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

int main() {
	long long int N, M, L;
	while( cin >> N, N ) {
		vector<set<long long int>>d( N );
		for( size_t i = 0; i < N; i++ ) {
			//d[i].insert( i + 1 );
			cin >> M;
			for( size_t j = 0; j < M; j++ ) {
				cin >> L;
				d[i].insert( L );
			}
		}
		cin >> M;
		vector<long long int>x( M );
		for( size_t i = 0; i < M; i++ ) {
			cin >> x[i];
		}
		[&] () {
			long long int ans = -1;
			for( size_t i = 0; i < N; i++ ) {
				auto ret = [&] () {
					for( size_t j = 0; j < M; j++ ) {
						if( d[i].find( x[j] ) == d[i].end() ) {
							return -1LL;
						}
					}
					return (long long int)i + 1;
				}();
				if( ans == -1 ) {
					ans = ret;
				} else {
					if( ret != -1 ) {
						cout << -1 << endl;
						return;
					}
				}
			}
			cout << ans << endl;
			return;
		}();
	}
}

C++: #include <iostream>

using namespace std;

int n;
bool b[105][105];
bool c[105];

int main(void)
{
	while(1){
		cin >> n;
		if(n == 0) break;
		
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				b[i][j] = false;
			}
		}
		int m, p;
		for(int i = 1; i <= n; i++){
			cin >> m;
			for(int j = 0; j < m; j++){
				cin >> p;
				b[i][p] = true;
			}
		}
		int k;
		cin >> k;
		for(int i = 1; i <= n; i++) c[i] = false;
		for(int i = 1; i <= k; i++){
			cin >> p;
			c[p] = true;
		}
		
		int ans = 0, ans_i;
		for(int i = 1; i <= n; i++){
			bool flag = true;
			for(int j = 1; j <= n; j++){
				if(c[j] && !b[i][j]) flag = false;
			}
			if(flag) ans++, ans_i = i;
		}
		if(ans == 1) cout << ans_i << endl;
		else cout << -1 << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>

#define N 110

using namespace std;

int main(void)
{
	int n,m,k;
	int i1,i2;
	int p;
	int info[N][N];

	while(1){
		cin >> n;
		if (n==0) break;

		vector<pair<int,int> > mem(n);

		for(i1=0;i1<n;i1++){
			mem[i1].first = 0;
			mem[i1].second = i1+1;
		}

		memset(info,0,sizeof(info));


		for(i1=1;i1<n+1;i1++){
			cin >> m;

			for(i2=0;i2<m;i2++){
				cin >> p;
				info[i1][p]=1;
			}

		}

		cin >> k;
		for(i1=0;i1<k;i1++){
			cin >> p;

			for(i2=1;i2<n+1;i2++){
				if(info[i2][p]==1){
					mem[i2-1].first++;
				}
			}
		}

		sort(mem.begin(), mem.end());

		if(mem[n-1].first!=k || mem[n-1].first==mem[n-2].first) cout << -1 << endl;
		else cout << mem[n-1].second << endl;
	}

	return 0;
}