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 <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>

using namespace std;

#define INF 1010001000
#define EPS 1e-10
#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

typedef pair<int, int> i_i;
typedef long long int llong;
typedef pair<llong, llong> ll_ll;
typedef struct edge {int f, t;}Edge;


int main()
{
    int n;
    while (cin >> n, n) {
        vector<vector<bool> > key(n+1, vector<bool>(n+1, false));
        rep(i, n) {
            int k;
            cin >> k;
            rep(j, k) {
                int a;
                cin >> a;
                key[i+1][a] = true;
            }
        }
        int k;
        cin >> k;
        vector<bool> ch(n+1, true);
        rep(i, k) {
            int a;
            cin >> a;
            rep(j, n+1) {
                if (!(key[j][a] && ch[j])) {
                    ch[j] = false;
                }
            }
        }
        int ret = 0;
        rep(i, n+1) {
            if (ch[i] && !ret) {
                ret = i;
            } else if (ch[i] && ret) {
                ret = -1;
            }
        }
        if (!ret) {
            ret = -1;
        }
        cout << ret << endl;
    }

    return 0;
}

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

using namespace std;

bool intension(set<int>& s1, set<int>& s2) {
	if (s1.size() < s2.size()) {
		return false;
	}

	for (set<int>::iterator itr = s2.begin(); itr != s2.end(); ++itr) {
		if ((s1.find(*itr)) == s1.end()) {
			return false;
		}
	}
	return true;
}

int main(void) {
	int N;
	cin >> N;

	while (N != 0) {
		vector< set<int> > data(N+1);
		int cri = -1;
		int count = 0;
		int temp;
		int M;
		for (int i = 0; i < N+1; ++i) {
			cin >> M;
			for (int j = 0; j < M; ++j) { 
				cin >> temp;
				data[i].insert(temp);
			}
			
		}

		for (int i = 0; i < N; ++i) {
			if (count < 2) {
				if (intension(data[i], data[N])) {
					cri = i+1;
					++count;
				}
			}
		}
		if (count > 1) {
			cout << -1 << endl;
		}
		else {
			cout << cri << endl;
		}

		cin >> N;
	}

	return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std; 

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;
 
int main()
{
	while(1) {
		int n, m, k;
		cin >> n;
		if (!n) break;
		set<int> p[101];
		rep(i,0,n) {
			cin >> m;
			p[i].insert(i+1);
			rep(j,0,m) {
				int t; 
				cin >> t;
				p[i].insert(t);
			}
		}
		Vi l;
		cin >> k;
		rep(i,0,k) {
			int t;
			cin >> t;
			l.pb(t);
		}

		
		Vi  f;
		rep(i,0,n) {
			bool f2 = true;
			rep(j,0,k) {
				auto it = lower_bound(all(p[i]),l[j]);
				if (it == p[i].end()) {
					f2 = false;
					break;
				}
			}
			if (f2) f.pb(i);
		}
		//cout << "answer is ";
		if (len(f) == 1) cout << f[0]+1 << endl;
		else cout << -1 << endl;
	}

	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int n,cnt;
int m[101],p[101][101];
int k,l[101];
int main(){
  while(cin>>n&&n!=0){
    int ans=0;
    cnt=0;
    for(int i=0;i<n;i++){
      cin>>m[i];
      for(int j=0;j<m[i];j++){
        cin>>p[i][j];
      }
      sort(p[i],p[i]+m[i]);
    }
    cin>>k;
    for(int i=0;i<k;i++){
      cin>>l[i];
    }
    sort(l,l+k);
    for(int i=0;i<n;i++){
      int cp=0;
      for(int j=0;j<m[i];j++){
        if(l[cp]==p[i][j]){
          cp++;
        }
        if(cp==k){
          cnt++;
          ans=i;
        }
      }
    }
    if(cnt!=1)cout<<-1<<endl;
    else cout<<ans+1<<endl;
  }
}

C++: #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
using namespace std;
int main() {
	int n, m, k, c;
	while (cin >> n&&n != 0) {
		bool a[101][101];
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) a[i][j] = false;
		}
		for (int i = 1; i <= n; i++) {
			cin >> m;
			for (int j = 0; j < m; j++) {
				cin >> c;
				a[i][c] = true;
			}
		}
		cin >> k;
		int d[101];
		for (int i = 0; i < k; i++) {
			cin >> c;
			d[i] = c;
		}
		vector<int>e;
		for (int i = 1; i <= n; i++) {
			for (int j = 0; j < k; j++) {
				if (!a[i][d[j]]) goto stop;
			}
			e.push_back(i);
		stop:;
		}
		if (e.size() == 1) cout << e[0] << endl;
		else cout << -1 << endl;
	}
}