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 main(){
	int n;
	while(cin>>n){
		if(n==0) break;
		int m,p[n][n]={0},shitteru;
		for(int i=0;i<n;i++){
			cin>>m;
			for(int j=0;j<m;j++){
				cin>>shitteru;
				p[i][shitteru]=1;
			}
		}
		int k;
		cin>>k;
		int l[k];
		for(int i=0;i<k;i++){
			cin>>l[i];
		}
		int hannin=-1;
		for(int i=0;i<n;i++){
			int flg=1;
			for(int j=0;j<k;j++){
				if(p[i][l[j]]==0){
					flg=0;
					break;
				}
			}
			if(flg==1&&hannin==-1){
				hannin=i+1;
			}
			else if(flg==1&&hannin>-1){
				hannin=-1;
				break;
			}
		}
		cout<<hannin<<endl;
	}
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int n,m;
  while(cin >>n,n){
    int field[101][10] = {0},ans[10] = {0};
    for(int i=1,x; i<=n; i++){
      cin >>x;
      for(int j=0,r; j<x; j++){
	cin >>r;
	field[i][r/10] |= 1<<(r%10);
      }
    }
    cin >>m;
    for(int i=0,q; i<m; i++){
      cin >>q;
      ans[q/10] |= 1<<(q%10);
    }
    int x = 0;
    for(int i=1,j; i<=n; i++){
      for(j=0; j<10; j++){
	if((ans[j]&field[i][j]) != ans[j]){break;}
      }
      if(j == 10){
	if(!x){x = i;}
	else{x = -1;break;}
      }
    }
    cout <<x<<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].size()==0)continue;
            int now=0;
            int j;
            for(j=0;j<vect.size();j++){
                int out =0;
                while(vect[j]>vec[i][now]){
                    now++;
                    if(now >= vec[i].size()){
                        out=1;
                        break;
                    }
                }
                
                if(vect[j]<vec[i][now]||out==1)
                    break;
                if(vect[j]==vec[i][now]){
                    now++;
                }
            }
            if(vect[vect.size()-1]==vec[i][now-1]){
                suc++;
                po = i+1;
            }
        }
        if(suc==1){
            cout<<po<<endl;
        }
        else{
            cout<<-1<<endl;
        }
    }
    
    return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<cctype>

#define MP make_pair
#define PB push_back
#define REP(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef long long LL;
typedef vector<int> VI;

const int DX[] = { 1, 0, -1, 0 }, DY[] = { 0, -1, 0, 1 };

int main(){
	int n, m, k,pin,kin,yo=0,f=0,X;
	VI agent,p;

	while (1){

		cin >> n;
		if (n == 0){
			break;
		}
		VI flag(n, 0);

		for (int i = 0; i < n; i++){
			cin >> m;
			for (int j = 0; j < m; j++){
				cin >> pin;
				p.PB(pin);
			}
			p.PB(0);
		}
		cin >> k;
		for (int i = 0; i < k; i++){
			cin >> kin;
			agent.PB(kin);
		}
		for (int i = 0; i < k; i++){
			for (int j = 0; j < p.size(); j++){
				if (p[j] == agent[i]){
					flag[yo] = flag[yo] + 1;
				}
				if (p[j] == 0)
					yo++;
			}
			yo = 0;
		}
		for (int i = 0; i < n; i++){
			if (flag[i] == k){
				f++;
				X = i + 1;
			}
		}
		if (f == 1){
			cout << X << endl;
		}
		else{
			cout << -1 << endl;
		}
	}
	return 0;
}

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

int main(){
  int n;

  while(1)
    {
      cin >> n;
      if(n ==0)break;

      for(int i = 0;i < n;i++)
	{
	  cin >> a[i];
	}
      for(int j = 0;j < a[0];j++)
	{
	  cin >> b[j];
	}

      cin >> k;
      for(int h = 0;h < k;h++)
	{
	  cin >> c[h];
	}

      for(int i = 0;i < n;i++)
	{
	  for(int j = 0;j < m;j++)
	    {
	      if(b[j] == c[j]){
		
		cnt++;		
		if(cnt == k)
		  {
		    
		    cout << a[j] << endl;
		  }
		else
		  {
		    cout << -1 << endl;
		  }
	      }
	    }
	}
    }
}