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++: //
//  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;
}

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

#define rep(i,n) for(int i = 0; i < n; i++)
using vi = vector<int>;
using vvi = vector<vi>;

int main(){
    int n;
    while(cin >> n,n){
      vector<set<int>> p(n);
        rep(i,n){
            int m; cin >> m;
            int x;
            rep(j,m){
                cin >> x;
                p[i].insert(x);
            }
        }
        int k; cin >> k;
        vi l(k); rep(i,k) cin >> l[i];
        vi ans;
        rep(i,n){
            bool f = true;
            rep(j,k){
                if(p[i].count(l[j]) == 0) f = false;
            }
            if(f){
                ans.push_back(i);
            }
        }
        if(ans.size() == 1) cout << ans[0]+1 << endl;
        else cout << -1 << endl;
    }
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<cstring>
using namespace std;

typedef __int64 ll;

int main(){
	int n;
	ll p[100][2];
	while(cin>>n&&n){
		memset(p,0,sizeof(p));
		for(int i=0;i<n;i++){
			int m;
			cin>>m;
			for(int j=0;j<m;j++){
				int a;
				cin>>a;
				p[i][a/64] |= 1LL<<(a&63);
			}
		}
		int k;
		ll q[2]={0};
		cin>>k;
		for(int i=0;i<k;i++){
			int a;
			cin>>a;
			q[a/64] |= 1LL<<(a&63);
		}
		int ans=-1;
		for(int i=0;i<n;i++){
			if((p[i][0]&q[0])==q[0]&&(p[i][1]&q[1])==q[1]){
				if(ans==-1)ans=i+1;
				else{
					ans=-1;
					break;
				}
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)


int main() {
	int n;
	while(cin >> n, n) {
		vector<vector<int> > ms(n, vector<int>());
		for(int i = 0; i < n; i++) {
			int m;
			cin >> m;
			for(int j = 0; j < m; j++) {
				int mss;
				cin >> mss;
				mss--;
				ms[i].push_back(mss);
			}
		}
		int k;
		cin >> k;
		vector<int> led(n);
		for(int i = 0; i < k; i++) {
			int j;
			cin >> j;
			j--;
			led[j] = 1;
		}
		bool summable = true;
		// fill one
		int kouho = -1;
		for(int i = 0; i < n; i++) {
			int count = 0;
			for(int j = 0; j < ms[i].size(); j++) {
				if(led[ms[i][j]]) count++;
			}
			if (count == k) {
				if (kouho != -1) {
					cout << -1 << endl;
					goto end_loop;
				}
				kouho = i;
			}
		}
		// fill some
		for(int i = 0; i < n; i++) {
			if (i == kouho) continue;
			int count = 0;
			for(int j = 0; j < ms[i].size(); j++) {
				if(led[ms[i][j]]) count++;
			}
			if (count == ms[i].size()) {
				for(int j = 0; j < ms[i].size(); j++) {
					led[ms[i][j]] = 2;
					//cout << "sum" << ms[i][j] << endl;
				}
			}
		}
		
		for(int i = 0; i < n; i++) {
			if (led[i] == 1) {
				summable = false;
				break;
			}
		}
		if (summable || kouho == -1) {
			cout << -1 << endl;
		}
		else {
			cout << kouho+1 << endl;
		}
		
		end_loop: {}
	}
	
	return 0;
}