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;


// type {{{
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int,int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;
// }}}


// macro {{{
#define rep(i,n) for (ll i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i,n) for (ll i=1, i##_len=(n); i<=i##_len; ++i)

#define SZ(x) ((ll)(x).size())

#define all(x) begin(x),end(x)
// }}}


// Debug {{{
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    rep (i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    return os << "(" << p.first << " " << p.second << ")";
}
// }}}


// chmax, chmin {{{
template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) { a = b; return true; }
    return false;
}
// }}}



// constants {{{
#define inf(T) numeric_limits<T>::max()

const ll MOD = 1e9+7;
const ld EPS = 1e-9;
// }}}


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    for (;;) {
        int N; cin >> N;
        if (N == 0) break;
        vector<map<int,bool>> p(N);
        rep (i, N) {
            int M; cin >> M;
            rep (_, M) {
                int tmp; cin >> tmp;
                p[i][tmp] = true;
            }
        }
        int K; cin >> K;
        vi l(K);
        rep (i, K) cin >> l[i];

        vi suspects;
        rep (i, N) {
            bool able = 1;
            rep (j, K) {
                if (p[i].count(l[j]) == 0) {
                    able = 0;
                }
            }
            if (able) suspects.push_back(i);
        }
        if (SZ(suspects) == 1) {
            cout << suspects[0] + 1 << endl;
        } else {
            cout << -1 << endl;
        }
    }

    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int n;
	while(cin>>n){
		if(n==0) break;
		int m,p[n][n],shitteru;
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				p[i][j]=0;
			}
		}
		for(int i=0;i<n;i++){
			cin>>m;
			for(int j=0;j<m;j++){
				cin>>shitteru;
				p[i][shitteru]=1;
			}
		}
		int k;
		cin>>k;
		int l[k];
		for(int i=0;i<k;i++){
			cin>>l[i];
		}
		int hannin=-1;
		for(int i=0;i<n;i++){
			int flg=1;
			for(int j=0;j<k;j++){
				if(p[i][l[j]]==0){
					flg=0;
					break;
				}
			}
			if(flg==1&&hannin==-1){
				hannin=i+1;
			}
			else if(flg==1&&hannin>-1){
				hannin=-1;
				break;
			}
		}
		cout<<hannin<<endl;
	}
    return 0;
}

C++: #include <bitset>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	for(int n; cin >> n, n;) {
		vector<bitset<101> > knows(n, bitset<101>(0));
		for(int i = 0; i < n; ++i) {
			int m;
			cin >> m;
			for(int j = 0; j < m; ++j) {
				int p;
				cin >> p;
				knows[i].set(p);
			}
		}

		bitset<101> leak;
		int k;
		cin >> k;
		for(int i = 0; i < k; ++i) {
			int p;
			cin >> p;
			leak.set(p);
		}

		int ans = -100;
		for(int i = 0; i < n; ++i) {
			if((leak & knows[i]) == leak) {
				if(ans == -100)
					ans = i + 1;
				else
					ans = -1;
			}
		}

		cout << (ans < 0 ? -1 : ans) << endl;
	}

	return EXIT_SUCCESS;
}

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++;
	    }
	  }
	  if(out==1)continue;
	  

	  // if(vect[vect.size()-1]==vec[i][now-1]&&count==(int)vect.size()){
	  if((int)vect.size() == count) {
	    suc++;
	    po = i+1;
//	    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;
//       	  }
        }
        if(suc==1){
	  cout<<po<<endl;
        }
        else{
	  cout << -1<<endl;
        }
          int mamam=out;
      }
    
    return 0;
}