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 <cstdio>
#include <cstring>

#define N 100

static int n;
static int m[ N ];
static int p[ N ][ N ];
static int l[ N ];
static int k;

/** Application main entry point. */
int
main (
  int     argc,
  char  * argv[ ]
  )
{
  int i, j;

  for ( ; ; )
  {
    int res = -1;

    scanf ( "%d", &n );
    if ( !( n ) ) break ;

    memset ( p, 0, sizeof ( p ) );
    memset ( l, 0, sizeof ( l ) );
    for ( i = 0; i < n; ++i )
    {
      scanf ( "%d", &m[ i ] );

      for ( j = 0; j < m[ i ]; ++j )
      {
        int t;

        scanf ( "%d", &t );
        p[ i ][ t - 1 ] = 1;
      }
    }
    scanf ( "%d", &k );
    for ( i = 0; i < k; ++i )
    {
      scanf ( "%d", &l[ i ] );
      --l[ i ];
    }

    for ( i = 0; i < n; ++i )
    {
      for ( j = 0; j < k; ++j )
      {
        if ( !p[ i ][ l[ j ] ] ) break ;
      }
      if ( j != k ) continue ;
      if ( res == -1 )
      {
        res = i + 1;
      }
      else
      {
        res = -1;
        break ;
      }
    }

    printf ( "%d\n", res );
  }

}

C++: #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef DEBUG
#define line() cerr << "[" << __LINE__ << "] ";
#define dump(i) cerr << #i ": " << i << " ";
#define dumpl(i) cerr << #i ": " << i << endl;
#else
#define line(i)
#define dump(i)
#define dumpl(i)
#endif
using namespace std;

bool is_contain(vector<int> &a, map<int, bool> &b)
{
    for (auto x : a)
    {
        if (b[x] == false)
        {
            return false;
        }
    }
    return true;
}

int main(int argc, char const *argv[])
{
    while (true)
    {
        int n;
        cin >> n;
        if (n == 0)
            break;
        map<int, bool> info[n];
        rep(i, n)
        {
            map<int, bool> mp;
            int t;
            cin >> t;
            rep(j, t)
            {
                int p;
                cin >> p;
                mp[p] = true;
            }
            info[i] = mp;
        }

        int t;
        cin >> t;
        vector<int> leak(t, 0);
        rep(i, t)
        {
            cin >> leak[i];
        }
        int ans = -1;
        rep(i, n)
        {
            if (is_contain(leak, info[i]))
            {
                if (ans == -1)
                {
                    ans = i + 1;
                }
                else
                {
                    ans = -1;
                    break;
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <cmath>
#include <fstream>
#include <random>
#include <iostream>
#include <algorithm>

using namespace std;


int main(){
  int n, m, k;
  bool flag, all_flag;
  vector< vector<int> > v;
  vector<int> leakage;
  vector<int> answer;
  vector<int> ms;
  while(true){
    cin >> n;
    if (n == 0)
    {
      break;
    }
    v.reserve(n);
    for (int i = 0; i < n; ++i)
    {
      cin >> m;
      ms.push_back(m);
      v[i].reserve(m);
      for (int j = 0; j < m; ++j)
      {
        cin >> v[i][j];
      }
    }
    cin >> k;
    leakage.reserve(k);
    for (int i = 0; i < k; ++i)
    {
      cin >> leakage[i];
    }

    // cout << n << endl;
    for (int i = 0; i < n; ++i)
    {
      all_flag = true;
      for (int t = 0; t < k; ++t)
      {
        flag = false;
        for (int j = 0; j < ms[i]; ++j)
        {
          if (v[i][j] == leakage[t])
          {
            flag = true;
            break;
          }
        }
        if (flag == false){
          all_flag = false;
          break;
        }
      }
      if (all_flag == true)
      {
        answer.push_back(i+1);
      }
    }
    if (answer.size() == 1){
      cout << answer[0] << endl;
    }else{
      cout << -1 << endl;
    }
    v.clear();
    leakage.clear();
    answer.clear();
    ms.clear();
  }
}

C++: #include <cstdio>
#include <set>

using namespace std;

#define MAX 128

int main()
{
	while(1) {
		int n;
		set<int> know[MAX];
		bool leak[MAX];
		memset(leak, true, sizeof(leak));
		
		scanf("%d", &n);
		if(!n) break;
		for(int i = 1; i <= n; i++) {
			int m;
			scanf("%d", &m);
			while(m--) {
				int p;
				scanf("%d", &p);
				know[i].insert(p);
			}
		}

		int k;
		scanf("%d", &k);
		while(k--) {
			int l;
			scanf("%d", &l);
			for(int i = 1; i <= n; i++) {
				if(!leak[i]) continue;
				set<int>::iterator it = know[i].find(l);
				if(it == know[i].end()) {
					leak[i] = false;
				}
			}
		}

		int ans = -1;
		for(int i = 1; i <= n; i++) {
			if(!leak[i]) continue;
			if(ans > 0) {
				ans = -1;
				break;
			}
			ans = i;
		}
		printf("%d\n", ans);
	}
	return 0;
}