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 <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <complex>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
const int INF = 1<<28;


int main() {
	int n;
	while(cin >> n, n) {
		vector< vector<int> > f;
		REP(i, n) {
			int m; cin >> m;
			vector<int> hoge;
			REP(j, m) {
				int in; cin >> in;
				hoge.push_back(in);
			}
			sort(hoge.begin(), hoge.end());
			f.push_back(hoge);
		}
		int k; cin >> k;
		int cnt, ans = 0;
		vector<int> l;
		REP(i, k) {
			int in; cin >> in;
			l.push_back(in);
		}
		sort(l.begin(), l.end());

//		REP(i, n) REP(j, f[i].size()) cout << i << ' ' << j << ' ' << f[i][j] << endl;
		REP(i, f.size()) {
			cnt = 0;
			REP(j, f[i].size()) {
				if(f[i][j] == l[cnt])
					cnt++; 
				if(cnt == k) {
					if(!ans) ans = i+1;
					else ans = -1;
					break;
				}
			}
		}
		if(ans == 0) ans = -1;
		cout << ans << endl;
	}
	return 0;
}

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[]) {
    //freopen ("/Users/shitian/Downloads/2399-in2.txt","r",stdin);
    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;
                 
            }
        }
        if(suc==1){
            cout<< po<<endl;
        }
        else{
            cout << -1<<endl;
        }
         
    }
     
    return 0;
}

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

int main(){


  int n,m,p,j,l,c=0;
  int r[1000],f[100][100],fc[100],w[100];

  for(int i=0;i<10;++i){
    for(int k=0;k<10; ++k){
      f[i][k] = 0;
    }
    fc[i]=0;
    w[i]=0;
  }
  
  while(1){
    cin >> n;
    if(n==0) break;
    if(c>10000) break;

    

    for(int i=0; i<n;++i){
      cin >>m;
      for(int k=0;k<m;++k){
	cin >> p;
	f[i][k] = p;
	++fc[i];
      }
    }

    cin >> j;
    for(int i = 0; i<j;++i){
      cin>>l;
      for(int k=0;k<n; ++n ){
	if(fc[k]>=j){
	  for(int t=0; t<fc[k];++t){
	    if(l==f[k][t]){
	      r[c] = k;
	      ++w[c];
	    }
	  }
	}
      }
    }
    
    ++c;
  }

  for(int i=0; i<c;++i){
    if(w[i]==1){
      cout << r[c]<<endl;
    }else  cout << -1 <<endl;
  }
  
  
  return 0;
}