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 <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;

#define For(i,a,b)	for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define rall(a)		(a).rbegin(), (a).rend()
#define sz(a)		(sizeof(a))
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
const int mod = 1000000007;
const int INF = 1e9;


int main()
{
	int n;
	while (cin >> n && n){
		const int M = 102;
		
		int m[M];
		int p[M][M];
		clr(p);

		For(i,1, n+1){
			cin >> m[i];
			p[i][i] = 1;
			rep(j, m[i]){
				int t;
				cin >> t;
				p[i][t] = 1;
			}
		}
		bool f[M]; clr(f);

		int am;
		cin >> am;
		rep(i, am){
			int t;
			cin >> t;
			rep(i, n){
				if (!p[i][t])f[i] = 1;
			}
		}

		int ans = -1; int sum = 0;
		rep(i, n){
			if (!f[i]){
				ans = i; sum++;
			}
		}
		if (sum == 1)cout << ans << endl;
		else cout << -1 << endl;
		
	}

	return 0;
}

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

int main(){
  int n,m,pr;
  int p[N]={};
  cin>>n;
  for(int i=1;i<=n;i++){
    cin>>m;
    for(int j=0;j<m;j++){
      cin>>pr;
      if(p[pr]==0)
    p[pr]=i;
      else 
	p[pr]=-1;
    }
  }
    cin>>m;
    int ans=0,f=0;
    for(int i=0;i<m;i++){
      cin>>pr;
      cout<<p[pr]<<endl;
      if(p[pr]>0 && f==0 &&(ans==0 || ans==p[pr])) ans=p[pr];
        }
    if(ans==0) ans=-1;
    cout<<ans<<endl;

  return 0;

}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
//constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	int kkt = 89;
	while (kkt) {
		ll N; scanf("%lld", &N); if (N == 0) break;
		vector<vector<ll>> p(N);
		for (int i = 0; i < N; i++) {
			ll M; scanf("%lld", &M);
			p[i].resize(M);
			for (int j = 0; j < M; j++) scanf("%lld", &p[i][j]);
			sort(p[i].begin(), p[i].end());
		}
		vector<ll> res;
		ll K; scanf("%lld", &K);
		vector<ll> l(K); for (ll i = 0; i < K; i++) scanf("%lld", &l[i]);
		for (int i = 0; i < N; i++) {
			bool flag = true;
			for (int j = 0; j < K; j++) {
				if (!binary_search(p[i].begin(), p[i].end(), l[j])) {
					flag = false;
					break;
				}
			}
			if (flag) res.push_back(i);
		}
		if (res.size() == 1) {
			printf("%lld\n", res[0] + 1);
		}
		else {
			puts("-1");
		}
	}

	return 0;
}

C++: #include <cstdio>

int main(){
	int n;
	while(scanf("%d",&n),n){
		bool x[100][100];
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++) x[i][j] = false;
		}
		for(int i = 0; i < n; i++){
			int m;
			scanf("%d", &m);
			for(int j = 0; j < m; j++){
				int p;
				scanf("%d", &p);
				p--;
				x[i][p] = true;
			}
		}
		int k;
		int l[100];
		scanf("%d", &k);
		for(int i = 0; i < k; i++){
			scanf("%d", &l[i]);
			l[i]--;
		}
		int cnt = 0;
		int ans = 0;
		for(int i = 0; i < n; i++){
			bool ok = true;
			for(int j = 0; j < k; j++){
				if(!x[i][l[j]]){
					ok = false;
					break;
				}
			}
			if(ok){
				ans = i+1;
				cnt++;
			}
		}
		if(cnt != 1) printf("-1\n");
		else printf("%d\n", ans);
	}
}