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>
using namespace std;

int search(int a[], int key, int n) {
	for (int i = 0; i < n; i++)
		if (a[i] == key) return 1;
	return 0;
}

int identify(int m[], int p[][100], int l[], int a, int b) {
	int isCrim[a] = {0};
	int count = 0, flag = 0;
	for (int i = 0; i < a; i++) {
		for (int j = 0; j < b; j++) {
			if (!search(p[i], l[j], m[i])) {
				flag = 1;
				break;
			}
		}
		if (!flag) {
			isCrim[i] = 1;
			count++;
		}
		flag = 0;
	}
	if (count != 1) return -1;
	for (int i = 0; i < a; i++)
		if (isCrim[i]) return i + 1;
}

int main() {
	while (true) {
		int n;
		cin >> n;
		if (n == 0) break;
		
		int m[n], p[n][100];
		for (int i = 0; i < n; i++)
			for (int j = 0; j < 100; j++)
				p[i][j] = 0;
			
		for (int i = 0; i < n; i++) {
			cin >> m[i];
			for (int j = 0; j < m[i]; j++)
				cin >> p[i][j];
		}
		
		int k;
		cin >> k;
		int l[k];
		for (int i = 0; i < k; i++)
			cin >> l[i];
		
		int crim = identify(m, p, l, n, k);
		cout << crim << 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[]) {
    
    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;
                
            }
        }
        int fai= -1;
        if(suc==1){
            cout<< po <<endl;
        }
        else{
            cout << -1 <<endl;
        }
        
    }
    
    return 0;
}

C++: #include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <vector>
#include <map>
#include <set>
using namespace std;

int main() {
    int N;
    while(cin >> N, N != 0) {
        vector<set<int>> v(N);
        for(int i=0; i<N; ++i) {
            int M;
            cin >> M;
            for(int j=0; j<M; ++j) {
                int p;
                cin >> p;
                v[i].insert(p);
            }
        }
        int K;
        set<int> s2;
        cin >> K;
        for(int i=0; i<K; ++i) {
            int t;
            cin >> t;
            s2.insert(t);
        }
        int ret=0;
        int id=0;
        for(int i=0; i<v.size(); ++i) {
            if(includes(v[i].begin(), v[i].end(), s2.begin(), s2.end())) {
                ret++;
                id = i+1;
            }
        }
        if(ret != 1) {
            cout << -1 << endl;
        } else {
            cout << id << endl;
        }
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n,k,data[100][101],x;
  while(cin>>n&&n){
    int cnt[100]={},num,ans=0;
    for(int i=0;i<n;++i){
      cin>>data[i][0];
      for(int j=1;j<=data[i][0];++j) cin>>data[i][j];
    }
    cin>>k;
    for(int i=0;i<k;++i){
      cin>>x;
      for(int j=0;j<n;++j){
	for(int l=1;l<=data[j][0];++l){
	  if(data[j][l]==x){
	    ++cnt[j];
	  }
	}
      }
    }
    for(int i=0;i<n;++i) {
      if(cnt[i]==k){
	num=i+1;
	++ans;
      }
    }
    if(ans==1) cout<<num<<endl;
    else cout<<"-1"<<endl;
  }
  return 0;
}