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, N ) {
		bool m[100][100] = {0};
		for (int i = 0; i < N; ++i) {
			int M; cin >> M;
			for (int j = 0; j < M; ++j) {
				int p; cin >> p;
				m[i][p-1] = true;
			}
		}

		bool leak[100] = {0};
		int K; cin >> K;
		for (int i = 0; i < K; ++i) {
			int p; cin >> p;
			leak[p-1] = true;
		}

		int ans = -1;
		for (int i = 0; i < N; ++i) {
			bool f = true;
			for (int j = 0; j < N; ++j) {
				if (leak[j] && !m[i][j]) {
					f = false;
					break;
				}
			}
			if (f) {
				if (ans != -1) {
					ans = -1;
					break;
				}
				ans = i+1;
			}
		}
		cout << ans << endl;
	}
}

C++: #include <cstdio>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
	while(true){
		int n;
		scanf("%d",&n);
		if(!n) break;
		bool aknowb[100][100]={};
		rep(i,n){
			int m;
			scanf("%d",&m);
			rep(j,m){
				int p;
				scanf("%d",&p);
				aknowb[i][p-1]=1;
			}
		}
		int k,l[100];
		scanf("%d",&k);
		rep(i,k) scanf("%d",l+i);
		int ans=-1;
		rep(i,n){
			bool ok=true;
			rep(j,k) if(!aknowb[i][l[j]-1]) ok=false;
			if(!ok) continue;
			if(ans!=-1){
				ans=-1;
				break;
			}else{
				ans=i+1;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <complex>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VEC;
typedef vector<VEC> MAT;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MT(a,b,c) MP(a, MP(b, c))
#define T1 first
#define T2 second.first
#define T3 second.second

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define EPS 1.0e-9

int know[100][100];

int main(){
	int n;
	while(cin>>n, n){
		memset(know, 0, sizeof(know));
		REP(i,n){
			int m;
			cin>>m;
			REP(j,m){
				int k;
				cin >>k;
				know[i][k-1]=1;
			}
		}
		int K;
		cin >> K;
		VI more(K);
		int idx = -1;
		int cnt = 0;
		REP(i,K){
			cin>>more[i];
			more[i]--;
		}
		REP(i,n){
			int stmp = 0;
			REP(j,K)stmp+=know[i][more[j]];
			if(stmp == K){
				idx = i+1;
				cnt++;
			}
		}
		if(cnt == 1)cout << idx << endl;
		else cout << -1 << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
 
using namespace std;
 
int main(){
  for(int n;cin>>n,n;){
    bool kn[100][101]={{}};
    for(int i=0;i<n;i++){
      int m;
      cin>>m;
      while(m--){
    int p;
    cin>>p;
    kn[i][p]=true;
      }
    }
    int k;
    cin>>k;
    bool pr[100];
    fill(pr,pr+100,true);
    while(k--){
      int l;
      cin>>l;
      for(int i=0;i<n;i++){
    if(!kn[i][l]){
      pr[i]=false;
    }
      }
    }
    cout<<((count(pr,pr+n,true)!=1)?-1:find(pr,pr+n,true)-pr+1)<<endl;
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
#define RREP(i, a, n) for(int i=n-1; i>=a; i--)

int main() {
	int N;
	while (cin >> N, N) {
		int M[101], K, l[101];
		int num[101][101];
		REP(i, 0, N) {
			cin >> M[i];
			REP(j, 0, M[i]) {
				cin >> num[i][j];
			}
		}
		cin >> K;
		REP(i, 0, K) cin >> l[i];

		int identify = -1;
		int person = 0;
		REP(i, 0, N) {
			if (M[i] < K) continue;

			int cnt = 0;
			REP(j, 0, K) {
				REP(k, 0, M[i]) {
					if (l[j] == num[i][k]) {
						cnt++;
						break;
					}
				}
			}

			if (cnt == K) {
				identify = i + 1;
				person++;
			}
		}

		if (person <= 1) cout << identify << endl;
		else cout << -1 << endl;
	}
	return 0;
}