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;

bool mem[101][100];

int main()
{
loop:
  for(int i = 0; i < 101; i++)
    for(int j = 0; j < 100; j++)
      mem[i][j] = 0;
  int n, m, p;
  cin >> n;
  if(!n)
    return 0;
  for(int i = 0; i < n; i++)
  {
    cin >> m;
    for(int j = 0; j < m; j++)
    {
      cin >> p;
      mem[i][p - 1] = true;
    }
  }
  cin >> m;
  for(int i = 0; i < m; i++)
  {
    cin >> p;
    mem[100][p - 1] = true;
  }
  int ans = -1;
  for(int i = 0; i < n; i++)
  {
    bool b = true;
    for(int j = 0; j < n; j++)
    {
      if(!mem[100][j])
        continue;
      if(!mem[i][j])
        b = false;
    }
    if(b)
    {
      if(ans != -1)
      {
        cout << -1 << endl;
        goto loop;
      }
      ans = i + 1;
    }
  }
  if(ans == -1)
    cout << -1 << endl;
  else
    cout << ans << endl;
  goto loop;
}

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>
#define REP(i,n) for(i=0; i<n; i++)
#define IREP(i,n) for(i=n-1; i>=0; i--)
#define X first
#define Y second;
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	int i,j,p,N,M,K;
	bool find;
	vector<int>::iterator ite;
	vector<int> hannin; 
	while(cin >> N, N!=0) {
		vector<int> v[N];
		REP(i,N) {
			cin >> M;
			REP(j,M) {
				cin >> p;
				v[i].push_back(p);
			}
		}
		cin >> K;
		int l[K];
		REP(i,K) cin >> l[i];
		REP(i,N) {
			REP(j,K) {
				find = false;
				ite=v[i].begin();
				while(ite!=v[i].end()) {
					if(*ite==l[j]) find=true;
					ite++;
				}
				if(find==false) break;
			}
			if(find==true) hannin.push_back(i);
		}
		if(hannin.size()==1) cout << hannin[0]+1 << endl;
		else cout << -1 << endl;
		hannin.clear();
	}
	return 0;
}

C++: #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;

int isSpy(set<int> &s, set<int> &L) {
  int cnt = 0;
  for(int a : s) for(int b : L) if(a == b) ++cnt;
  return cnt == L.size();
}

int solve(vector< set<int> > &S, set<int> &L) {
  int ans = -1;
  REP(i, S.size()) {
    if(isSpy(S[i], L)) {
      if(ans != -1) return -1;
      else ans = i + 1;
    }
  }
  return ans;
}

int main() {
  int N, n;
  while(cin >>N && N) {
    vector< set<int> > S(N);
    REP(i, N) {
      int M; cin >>M;
      REP(j, M) { cin >>n; S[i].insert(n); }
    }

    int K; cin >>K;
    set<int> L;
    REP(i, K) { cin >>n; L.insert(n); }

    cout <<solve(S, L) <<endl;
  }
  return 0;
}