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

C++: #include <string>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <utility>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iterator>
#include <sstream>

using namespace std;

bool t[101][101];
int n,k;
 
int solve()
{
    for (int i = 0; i < n; i++){
        int m; cin>>m;
        //t[i][i] = true;
        for (int j = 0; j < m; j++){
            int x; cin>>x;
            t[i][x-1] = true;
        }
    }
 
    cin>>k;
    vector<int> l(k);
    for (int i = 0; i < k; i++){
        cin>>l[i];  l[i]--;
    }
 
    int ans = -1;
 
    for (int i = 0; i < n; i++){
        int j = 0;
        for (; j < k; j++){
            if(!t[i][l[j]]) break;
        }
        if(j == k){
            if(ans == -1) {
                ans = i + 1;
            } else {return -1;}
        }
    }
 
    return ans;
}
 
int main(){
    while(cin >> n,n){
        memset(t,0,sizeof(t));
        int ans = solve();
        cout << ans << endl;
    }
    return 0;
}

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

using namespace std;

int main()
{
    while(1) {
        int N;
        cin >> N;
        if(N<=0) break;

        vector<set<int> > list(N);

        for(int i=0;i<N;++i) {
            int M;
            cin >> M;
            for(int j=0;j<M;++j) {
                int p;
                cin >> p;
                list[i].insert(p);
            }
        }

        int K;
        vector<int> l;
        cin >> K;
        for(int i=0;i<K;++i) {
            int p;
            cin >> p;
            l.push_back(p);
        }

        vector<int> hannin;
        for(int i=0;i<N;++i) {
            int j;
            for(j=0;j<K;++j) {
                if(list[i].find(l[j])==list[i].end()) {
                    break;
                }
            }
            if(j==K) {
                hannin.push_back(i+1);
            }
        }
        if(hannin.size()==1) {
            cout << hannin[0] << 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[]) {
    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){suc=100;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;
}