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 <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define pb push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define all(v) ALL(v)
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/


template<typename T> ostream& operator<<(ostream& os,const set<T> st){
    os << "[";
    for(T v : st) os << v << ",";
    os << "]" << endl;
}

int main(){
    int N;
    while(cin>>N){
        if(N==0) break;
//        cerr << "----------" << endl;

        set<int> p[128];

        for(int i=0;i<N;i++){
            int m;cin>>m;
//            debug(m);
            rep(j,m){
                int t;cin>>t;t--;
                p[i].insert(t);
            }
        }

        int k;cin>>k;
        vector<int> l(k);
        rep(i,k){
            cin >> l[i];
            l[i]--;
        }
        sort(all(l));

        vector<int> d;
        for(int i=0;i<N;i++){
            bool f=true;
            for(int j=0;j<k;j++){
                if(!p[i].count(l[j])){
                    f=false;
                    break;
                }
            }
            if(f) d.pb(i);
        }
//        debug(d);
        if(d.size()==1){
            cout << d[0]+1 << endl;
        }else{
            cout << -1 << endl;
        }
    }
}

C++: #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>

using namespace std;

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

#define all(v) v.begin(),v.end()
#define INF 1<<30
#define mp make_pair
#define pb push_back

#define fi first
#define se second

#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

typedef long long ll;

int main(){
	while(1){
		int n;
		cin >> n;
		if(n==0) break;
		bool a[101][101];
		rep(i,101) rep(j,101) a[i][j] = false;

		rep(i,n){
			int m;
			cin >> m;
			rep(i,m){
				int p; cin>>p;
				a[i+1][p] = true;
			}
		}

		int k; cin>>k;
		vi b(k);
		rep(i,k){
			int l; cin>>l;
			b.pb(k);
		}

		int ans;
		int cnt = 0;
		rep(i,n){
			bool f = true;
			rep(j,k){
				f &= a[i+1][b[k]];
			}
			if(f){
				cnt++;
				ans = i+1;
			}
		}
		if(cnt==1){
			cout<<ans<<endl;
		}
		else{
			cout<<-1<<endl;
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main() {
  int n,i,j,c,q;
  while(cin>>n,n){
    int a[n+1][n]={0},k=0,p;
    for(i=0;i<=n;i++){
      for(cin>>a[i][0],j=1;j<=a[i][0];j++)cin>>a[i][j];
    }
  for(i=0;i<n;i++){
    for(q=j=1;j<=a[i][0];j++){
      if(a[n][q]==a[i][j])q++;
    }
    if(q-1==a[n][0]){
      k++;
      p=i+1;
    }
  }
  if(k==1)cout<<p<<endl;
  else cout<<-1<<endl;
  }
}

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

using namespace std;

int solve(vector<set<int> > info,vector<int> seq){
	int c=0;
	int ans=0;
	for(int i=0;i<info.size();i++){
		bool b=true;
		for(int k=0;k<seq.size();k++){
			if(info[i].find(seq[k])==info[i].end()){
				b=false;
				break;
			}
		}
		if(b){c++;
			ans = i;
			if(c>1)return -1;
		}
	}
	if(c>1)return -1;
	if(c==0)return -1;
	return ans+1;
}

int main(){
	while(true){
		int n;
		cin >> n;
		if(n==0)return 0;
		vector<set<int> > info(n);

		for(int i=0;i<n;i++){
			int m;
			cin >> m;
			for(int k=0;k<m;k++){
				int t;
				cin >> t;
				info[i].insert(t);
			}
			//info[i].insert(i);
		}
		vector<int> seq;
		int m;
		cin>>m;
		for(int i=0;i<m;i++){
			int t;
			cin >> t;
			seq.push_back(t);
		}
		cout << solve(info,seq) << endl;
	}
}