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"bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)

signed main() {
	for (int N; cin >> N && N;) {
		vector<vector<bool>> v(N, vector<bool>(N));

		rep(i, 0, N) {
			int M; cin >> M;
			rep(j, 0, M) {
				int p; cin >> p;
				p--;
				v[i][p] = true;
			}
		}
		int K; cin >> K;
		vector<int> l(K); rep(i, 0, K) {
			cin >> l[i];
			l[i]--;
		}

		set<int> st;
		rep(i, 0, N) {
			st.insert(i);
		}

		rep(i, 0, K) {
			rep(j, 0, N) {
				if (!v[j][l[i]])
					st.erase(j);
			}
		}

		if (st.size() == 1) {
			cout << *st.begin() + 1 << endl;
		}
		else {
			cout << -1 << endl;
		}
	}
	

	return 0;
}

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

using namespace std;


int main(){
  int n, m, k;
  vector< vector<int> > v;
  vector<int> leakage;
  vector<int> answer;
  while(true){
    cin >> n;
    if (n == 0)
    {
      break;
    }
    v.reserve(n);
    for (int i = 0; i < n; ++i)
    {
      cin >> m;
      v[i].resize(m);
      for (int j = 0; j < m; ++j)
      {
        cin >> v[i][j];
      }
    }
    cin >> k;
    leakage.reserve(k);
    for (int i = 0; i < k; ++i)
    {
      cin >> leakage[i];
    }
    for (int i = 0; i < v.size(); ++i)
    {
      for (int k = 0; k < leakage.size() ; ++k)
      {
        bool flag = false;
        for (int j = 0; j < v[i].size; ++j)
        {
          if (v[i][j] == leakage[k])
          {
            flag = true;
            break;
          }
        }
        if (flag == false){
          break;
        }
      }
      answer.push_back(i+1);
    }
    if (answer.size() == 1){
      cout << answer[0] << endl;
    }else{
      cout << -1 << endl;
    }
    v.clear();
    leakage.clear();
    answer.clear();
  }
}

C++: #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;


using namespace std;

int main()
{
  

  while(1){
    int n;
    cin >> n;
    if(n==0) break;
    
    vector< vector<int> > numList;

    rep(i,n){
      int tmp; cin >> tmp;
      vector<int> tmp2;
      rep(j,tmp){
        int a; cin >> a;
        tmp2.push_back(a);
      }
      numList.push_back(tmp2);
    }
    
    int data1[150],data2[150];
    memset(data1,0,sizeof(data1));
 
    int m; cin >> m;
    vector<int> ans;
    rep(i,m){
      int b; cin >> b;
      data1[b]=1;
      ans.push_back(b);
    } 
    
    int count=0;
    int hannin;
    rep(i,n){
      
      memset(data2,0,sizeof(data2));
      rep(j,numList[i].size()){
        data2[numList[i][j]]=1;
      //  cout << "debug" << numList[i][j] << endl;
      }
      bool flag=true;
      rep(j,ans.size()){
        if(data2[ans[j]]!=data1[ans[j]]) flag=false;
       // cout << data1[ans[j]] <<  " " << data2[ans[j]] << endl;
      }  
    
      if(flag){
        count++;
        hannin=i;
      } 
    }
    
    if(count==1) cout << hannin+1 << endl;
    else cout << -1 << endl;
    
  }
}

C++: #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main(){
	int N;
	while( cin >> N && N ){
		vector< set<int> > member(N);
		for( int i = 0; i < N; i++ ){
			int M;
			cin >> M;
			for( int j = 0; j < M; j++ ){
				int m;
				cin >> m;
				member[i].insert( m );
			}
		}
		int K;
		cin >> K;
		set<int> list;
		for( int i = 0; i < K; i++ ){
			int l;
			cin >> l;
			list.insert( l );
		}
		int ans = -1;
		int f = 0;
		for( int i = 0; i < N; i++ ){
			set<int>::iterator it = member[i].begin();
			set<int>::iterator it2 = list.begin();
			for( ; it != member[i].end(); it++ ){
				if( *it2 == *it ){
					it2++;
				}
				if( *it2 < *it ){
					break;
				}
			}
			if( it2 == list.end() ){
				if( f == 0 ){
					f = 1;
					ans = i + 1;
				}else{
					ans = -1;
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include<iostream>
#include<vector>
using namespace std;
#define REP(i, b, e) for ( int i = b; i < (int)e; i++ )
#define rep(i, n) REP(i, 0, n)
static const int MAX = 100;
main(){
  int N, k; 
  bool T[MAX][MAX], C[MAX];
  while(1){
    cin >> N;
    if ( N == 0 ) break;
    rep(i, N) rep(j, N) T[i][j] = C[i] = false;
    rep(i, N){
      cin >> k;
      rep(s, k) {
	int j; cin >> j; j--;
	T[i][j] = true;
      }
    }
    cin >> k;
    rep(i, k){
      int j; cin >> j; j--;
      C[j] = true;
    }
    vector<int> ans;
    rep(i, N){
      bool suc = true;
      rep(j, N){
	if ( C[j] && !T[i][j] ) suc = false;
      }
      if ( suc ) ans.push_back(i+1);
    }

    if ( ans.size() == 1 ) cout << ans[0] << endl;
    else cout << -1 << endl;
  }
}