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<vector>
#include<algorithm>
#include<cstdio>
#include<math.h>
#include<string>
#include<set>
using namespace std;

int main(){
	int m,n,count,flg,hannin;
	int member[100][101], info[101];
	//Input
	while(1){
		scanf(" %d",&n);
		if(n==0) break;
		for(int i=0; i < 100; i++){
			for(int j=0; j < 100; j++){
				member[i][j] = 0;
			}
		}
		for(int i=0; i < n; i++){
			scanf(" %d",&member[i][0]);
			for(int j=1; j < member[i][0]+1; j++){
				scanf(" %d",&member[i][j]);
			}
		}
		scanf(" %d",&info[0]);
		for(int i=1; i<info[0]+1; i++){
			scanf(" %d",&info[i]);
		}

		flg = 0;
		hannin = -1;
		for(int i=0; i < n; i++){
			count = 0;
			for(int j=1; j < member[i][0]+1; j++){
				for(int k=1; k < info[0]+1; k++){
					if(info[k]==member[i][j]){
						count++;
					}
				}
			}
			if(count == info[0]){
				if(flg == 0){
					hannin = i+1;
					flg = 1;
				}else{
					hannin = -1;
					break;
				}
			}
		}
		printf("%d\n",hannin);	
	}
}

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

using ll=long long;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)

int read(){
	int i;
	scanf("%lld",&i);
	return i;
}

signed main(){
	while(true){
		int N=read();
		if(N==0) break;
		vector<vector<int>> p;
		p.resize(N);
		REP(i,N){
			int M=read();
			REP(j,M){
				p[i].push_back(read());
			}
		}
		int K=read();
		int l[K];
		REP(i,K){
			l[i]=read();
		}
		int ans=0;
		REP(i,N){
			REP(k,K){
				if(find(p[i].begin(),p[i].end(),l[k])==p[i].end()){
					break;
				}
				if(k==K-1){
					if(ans==0) ans = i+1;
					else ans = -1;
				}
			}
		}
		if(ans==0) cout << -1 << endl;
		else cout << ans << endl;
	}
	
	
	
}

C++: #import<iostream>
using namespace std;int x[200][200],y[200],z[200],n,i,a,j,k,b,s,c;main(){while(1){cin>>n;b=0;if(!n){break;}for(i=1;i<=n;i++){cin>>z[i];for(j=0;j<z[i];j++){cin>>x[i][j];}}cin>>a;for(i=0;i<a;i++){cin>>y[i];}for(i=1;i<=n;i++){s=0;for(j=0;j<a;j++){for(k=0;k<z[i];k++){if(x[i][k]==y[j]){s++;}}}if(s==a){c=i;b++;}}if(b-1){c=-1;}cout<<c<<endl;}}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
	int n;
	while(cin>>n,n){
		bool data[100][100],f[100];
		memset(data,false,sizeof(data));
		memset(f,true,sizeof(f));
		for(int i=0;i<n;i++){
			int m,a;
			cin>>m;
			for(int j=0;j<m;j++){
				cin>>a;a--;
				data[i][a]=true;
			}
		}
		int k,b;
		cin>>k;
		for(int i=0;i<k;i++){
			cin>>b;b--;
			for(int j=0;j<n;j++){
				if(!data[j][b])f[j]=false;
			}
		}
		bool g=false;
		int ans=-1;
		for(int i=0;i<n;i++){
			if(f[i]&&ans!=-1){
				g=true;
			}else if(f[i]){
				ans=i+1;
			}
		}
		if(!g&&ans!=-1)cout<<ans<<endl;
		else cout<<-1<<endl;
	}
}

C++: #! /usr/bin/env python
# -*- coding: utf-8 -*-

import os
import sys
import itertools
import math
from collections import Counter, defaultdict

class Main(object):
    
    def __init__(self):
        pass

    def solve(self):
        '''
        insert your code
        '''
        while True:
            n = input()
            if n == 0:
                break
            p = []
            for i in range(n):
                p.append(map(int, raw_input().split())[1:])
            l = map(int, raw_input().split())[1:]
            flg = False
            num = -1
            for i in range(n):
                if set(l) <= set(p[i]):
                    if flg:
                        num = -1
                        break
                    else:
                        flg = True
                        num = i + 1
            print num
        return None

if __name__ == '__main__':
    m = Main()
    m.solve()

C++: #include<bits/stdc++.h>
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

int main() {
	int n;
	while (scanf("%d", &n), n) {
		bitset<100>b[100], t;
		rep(i, n) {
			int m; scanf("%d", &m);
			rep(j, m) {
				int p; scanf("%d", &p); p--;
				b[i] |= bitset<100>(1) << p;
			}
		}
		int k; scanf("%d", &k);
		rep(i, k) {
			int l; scanf("%d", &l); l--;
			t |= bitset<100>(1) << l;
		}
		bool ok = true;
		int id = -1;
		rep(i, n) {
			if ((b[i] | t) == b[i]) {
				if (id == -1)id = i + 1;
				else ok = false;
			}
		}
		if (ok)printf("%d\n", id);
		else puts("-1");
	}
}

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 j = 0; j < m; j++ ) {

	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 j = 0; j < n; j++ ) {

      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;

}