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++: //
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015???´ 13B10694. All rights reserved.
//

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
    
    int n, in, m, k;
    while(cin>>n,n){
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            
            if(vec[i].empty() && !vect.empty())continue;
            int now=0;
            int j;int out =0,count=0;
            for(j=0;j<vect.size();j++){
                
                while(vect[j]>vec[i][now]){
                    now++;
                    if(now >= (int)vec[i].size()){
                        out=1;
                        break;
                    }
                }
                
                if(vect[j]<vec[i][now]||out==1)
                    break;
                if(vect[j]==vec[i][now]){
                    now++;count++;
                }
            }
           // cout<<"out:  "<<out<<"     count:  "<<count<<endl;
            if(out==1){continue;}
            //cout<<"out:  "<<out<<"     count:  "<<count<<endl;
            
            // if(vect[vect.size()-1]==vec[i][now-1]&&count==(int)vect.size()){
            if((int)vect.size() == count) {
                suc++;
                po = i+1;
//                cout<<"out: "<<out<<endl;
//                      cout << "=======" << i << endl;
//                      cout<<out<<endl;
//                      for(int j=0; j<vec[i].size(); j++) cout << vec[i][j] << " ";
//                      cout << endl;
//                      for(int j=0; j<vect.size(); j++) cout << vect[j] << " ";
//                      cout << endl;
                
            }
        }
        int fai= -1;
        if(suc==1){
            cout<< po <<endl;
        }
        else{
            cout << fai <<endl;
        }
        
    }
    
    return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)

const int MAXN = 101, MAXK = 101;

int n,m,k,t,p,l;
bool joho[MAXN][MAXN];
bool still[MAXN];

int main()
{
    while(cin >> n && n)
    {
        memset(still, true, sizeof(still));
        int ans = -1;
        int num = 0;
        for(int i=1;i<=n;i++)
        {
            cin >> t;
            rep(j,t)
            {
                cin >> p;
                joho[i][p] = true;
            }
        }

        cin >> k;
        rep(j,k)
        {
            cin >> l;
            for(int i = 1;i<=n;i++) still[i] = still[i] & joho[i][l];
        }

        for(int i=1;i<=n;i++)if(still[i])
        {
            ans = i;
            num++;
        }
        if(num>=2 || num == 0) {cout << -1 << endl; continue;}
        else cout << ans << endl;

    }

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using lint = long long int;
using ulint = unsigned long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T, class U> void assign(V<T>& v, int n, const U& a) { v.assign(n, a); }
template<class T, class... Args> void assign(V<T>& v, int n, const Args&... args) { v.resize(n); for (auto&& e : v) assign(e, args...); }


int main() {
  cin.tie(nullptr); ios_base::sync_with_stdio(false);
  while (true) {
    int n; cin >> n;
    if (n == 0) break;
    V< bitset<100> > bs(n);
    for (int i = 0; i < n; ++i) {
      int m; cin >> m;
      for (int j = 0; j < m; ++j) {
        int p; cin >> p, --p;
        bs[i][p] = true;
      }
    }
    bitset<100> b;
    int m; cin >> m;
    for (int j = 0; j < m; ++j) {
      int p; cin >> p, --p;
      b[p] = true;
    }
    set<int> se;
    for (int i = 0; i < n; ++i) {
      if ((b | bs[i]) == bs[i]) {
        se.insert(i);
      }
    }
    if (se.size() != 1) cout << -1 << '\n';
    else cout << *begin(se) + 1 << '\n';
  }
}