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;

int main(){
	int p[110][110], N, M[110], K, l[110];
	while(1){
		int a = 0, b[110] = {}, c = 0;

		cin>>N;
		if(N == 0) break;

		for(int i = 0; i < N; i++){
			cin>>M[i];
			for(int j = 0; j < M[i]; j++){
				cin>>p[i][j];
			}
		} 
		cin>>K;
		for(int i = 0; i < K; i++){
			cin>>l[i];
		}
	
		for(int i = 0; i < K; i++){
			for(int j= 0; j < N; j++){
				int x = 0;
				if(b[j] == 1) break;
				for(int k = 0; k < M[j];k++){
					if(l[i] == p[j][k]){
						x = 1;
			
					}
				}
				
				if(x == 0) b[j] = 1;
			}
		}
		
		for(int i = 0; i < N; i++){
			if(b[i] == 0) {
				a++;
				c = i;
			}
			
		}
		if(a == 1) cout<<c + 1<<endl;
		else cout<<"-1"<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<set>
#include<algorithm>
using namespace std;
#define ALL(a) a.begin(),a.end()
int main(){
  int n;
  while( cin >> n , n ){
    set< int > p[n],L,tmp;
    for(int i = 0, q, d ; i < n ; i++ ){
      cin >> q;
      while(q--) cin >> d, p[i].insert(--d);
    }
    int K, l, ans = -1, i;
    cin >> K;
    while(K--) cin >> l, L.insert(--l);
    for( i = 0 ; i < n ; i++ ){
      if(includes(ALL(p[i]),ALL(L))){
        if(ans == -1) ans = i + 1;
        else break;
      }
    }
    cout << (i == n ? ans : -1) << endl;
  }
}

C++: #include <stdlib.h>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>

using namespace std;

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

const int INF=100000000;
const bool debug=1;

int main(){

  int N;
  while(cin>>N,N){
    bool info[N][N];
    bool Kinfo[N];
    REP(i,N)REP(j,N)info[i][j]=false;
    REP(i,N)Kinfo[i]=false;
    REP(i,N){
      int M;
      cin>>M;
      REP(j,M){
	int p;
	cin>>p;
	p--;
	info[i][p]=true;

      }
    }
    int K;
    cin>>K;
    REP(i,K){
      int l;
      cin>>l;
      l--;
      Kinfo[l]=true;
    }

    int count=0;
    int ans=-1;
    REP(i,N){
      bool flag=true;
      REP(j,N){
	if(Kinfo[j] && !info[i][j]){flag=false;break;}
      }
      if(flag){ans=i;count++;}
    }

    if(count==1)cout << (ans+1) << endl;
    else cout << -1 << endl;
  }
}

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++;
                }
            }
            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<<"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;
}