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 x[200][200],y[200],z[200],n,i,a,j,k,b,s,c;
int main(){
while(true){
cin>>n;b=0;
if(!n){break;}
for(i=1;i<=n;i++){
cin>>z[i];
for(j=0;j<z[i];j++){
cin>>x[i][j];
}
}
cin>>a;
for(i=0;i<a;i++){cin>>y[i];}
for(i=1;i<=n;i++){
s=0;
for(j=0;j<a;j++){
for(k=0;k<z[i];k++){
if(x[i][k]==y[j]){
s++;
}
}
}
if(s==a){c=i;b++;}
}
if(b-1){c=-1;}
cout<<c<<endl;
}
}

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(vector<int> &v, vector<int> &L) {
 int cnt = 0;
  for(int a : v) for(int b : L) if(a == b) ++cnt;
  return cnt == L.size();
}

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

int main() {
  int N;
  while(cin >>N && N) {
    vector< vector<int> > V(N);
    REP(i, N) {
      int M; cin >>M;
      V[i] = vector<int>(M);
      REP(j, M) cin >>V[i][j];
    }

    int K; cin >>K;
    vector<int> L(K);
    REP(i, K) cin >>L[i];

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

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

int main(){
  int N,K,ans;
  int p[100][100];
  int l[100];

  while(true){
    cin >> N;
    if(N == 0) break;

    int *M = new int[N];
    
    for(int i=0;i<N;++i){
      cin >> M[i];

    
      for(int ix=0;ix<M[i];++ix){
	cin >> p[i][ix];
      }
    }
    
    cin >> K;
    
    for(int i=0;i<K;++i)
      cin >> l[i];
    
    
    int cnt = 0;
    for(int i=0;i<N;++i){
      if(K>M[i]) break;
      
      bool w = true;
      for(int k=0;k<K;++k){
	for(int ix = 0; ix<M[i]; ++ix){
	  if(l[k] == p[i][ix]){
	    break;
	  }
	  if(ix == M[i] - 1) w = false;
	}
	if(!w) break;
      }
      
      if(w) {
	++cnt;
	ans = i;
      }
    }

    if(cnt == 1){
      cout << ans + 1 << endl;
    }else{
      cout << -1 << endl;
    }

    delete[] M;

  }
  
  return 0;
}

C++: #include <iostream>
#include <set>
#include <vector>
using namespace std;

int find(vector<int> kk, vector<vector<int>> a){
  int flag=0;
  int person=0;
  set<int> kkk(kk.begin(), kk.end());

  for(int j=0;j<a.size();j++){
    int cnt=0;
    for(int k=0;k<a[j].size();k++){
      if(kkk.find(a[j][k])!=kkk.end()){
         cnt++;
         if(cnt==kkk.size()){
           person=j+1;
           flag++;
         }
      }
    }
  }

  if(flag!=1)
    return 0;
  else
    return person;
}

int main(){
  int n;

  while(cin>>n&&n){
    vector<vector<int>> a(n);
    vector<int> kk;

    for(int i=0;i<n;i++){
      int m;
      cin >> m;
      for(int j=0;j<m;j++){
        int p;
        cin >> p;
        a[i].push_back(p);
      }
    }

    int k;
    cin >> k;
    int person;
    for(int i=0;i<k;i++){
      int l;
      cin >> l;
      kk.push_back(l);
    }

    person = find(kk, a);

    if(person!=0) cout << person << endl;
    else cout << -1 << endl;

  }

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  while(cin >> N,N){
    vector<set<int>> know(N);
    for(int i=0;i<N;i++){
      int M;
      cin >> M;
      for(int j=0;j<M;j++){
	int p;
	cin >> p;
	know[i].insert(p-1);
      }
    }
    int K;
    cin >> K;
    vector<int> k(K);
    for(int i=0;i<K;i++){
      cin >> k[i];
      k[i]--;
    }
    vector<int> ans;
    for(int i=0;i<N;i++){
      bool f=true;
      for(int j=0;j<K;j++)
	if(know[i].find(k[j])==know[i].end())
	  f=false;
      if(f)
	ans.push_back(i);
    }
    if(ans.size()==1)
      cout << ans[0]+1 << endl;
    else
      cout << -1 << endl;
  }
  return 0;
}