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>
#define int long long
#define range(i,x,y) i=(x);i<(y);i++
#define all(x) begin(x),end(x)
#define lim(x,r,l) (r<=x&&x<l)
typedef long long ll;
typedef long double ld;
using namespace std;

signed main(){
  int n;
  while(cin >> n, n != 0){
    vector<vector<int>> p(n);
    for(int range(i,0,n)){
      int m;
      cin >> m;
      p[i] = vector<int>(m);
      for(int range(j,0,m)){
        cin >> p[i][j];
      }
      sort(all(p[i]));
    }
    int k;
    cin >> k;
    vector<int> l(k);
    for(int range(j, 0, k)){
      cin >> l[j];
    }
    sort(all(l));
    int id = -2;

    for(int range(i,0,n)){

      if(includes(all(p[i]), all(l))){
        if(id==-2){
          id = i;
        }else{
          id = -3;
        }
      }
    }
    cout << max(-1ll, id+1) << endl;
  }
}

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

using namespace std;

int n, k, m[256];
bool know[256][256];
bool leak[256];

int main(){

	while(cin>>n, n){
		
		memset(know, 0, sizeof(know));
		memset(leak, 0, sizeof(leak));

		for(int i=0; i<n; ++i){
				
			int m;
			cin>>m;
			
			for(int j=0; j<m; ++j){
				
				int p;
				cin>>p;
				know[i][--p] = true;
			}
		}

		cin>>k;

		for(int i=0; i<k; ++i){
			
			int l;
			cin>>l;
			leak[--l]=true;
		}

		int spy = -1;
		
		for(int i=0; i<n; ++i){

			bool f = true;
			int cnt = 0;

			for(int j=0; j<n; ++j){
				
				if( i != j && !know[i][j] && leak[j] ){
					f = false;
					break;
				}

				if( know[i][j] && leak[j] ){
					cnt++;
				}
			}
			
			if(f&&cnt==k){
				if(spy==-1)
					spy = i;
				else
					spy = -2;
			}
		}

		cout << (spy>=0?++spy:-1) << endl;
	}

	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main() {
  int n;
  while(cin >> n && n){
    int k,t;
    vector<vector<int> > p(n);
    vector<int> l;
    for(int i=0;i<n;++i){
      cin >> k;
      for(int j=0;j<k;++j) {
	cin >> t;
	p[i].push_back(t);
      }
      sort(p[i].begin(),p[i].end());
    }
    cin >> k;
    for(int i=0;i<k;++i){
      cin >> t;
      l.push_back(t);
    }
    sort(l.begin(),l.end());
    pair<int,int> ans;
    for(int i=0;i<n;++i){
      int tmp=0,cnt=0;
      for(int j=0;j<p[i].size();++j){
	if(tmp<l.size() && l[tmp]==p[i][j]) cnt++,tmp++;
      }
      if(cnt==l.size()) ans.first++,ans.second=i+1;
    }
    if(ans.first==1) cout << ans.second << endl;
    else cout << -1 << endl;
  }
  return 0;
}

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

int main(){
	int x,n,m,k,i;
	for(;scanf("%d",&n),n;){
		vector<set<int> >v;
		for(i=0;i<n;i++){
			set<int>s;
			for(scanf("%d",&m),k=0;k<m;k++)
				scanf("%d",&x),s.insert(x);
			v.push_back(s);
		}
		set<int>t;
		for(scanf("%d",&k),m=0;m<k;m++)
			scanf("%d",&x),t.insert(x);
		vector<int>w;
		for(k=0;k<n;k++){
			set<int>s;
			set_intersection(v[k].begin(),v[k].end(),t.begin(),t.end(),inserter(s,s.end()));
			if(s.size()==t.size())w.push_back(k);
		}
		printf("%d\n",w.size()==1?w[0]+1:-1);
	}
}

C++: #include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;

int N;
int K;
int M[103];
int p[103][103];
int l[103];

bool check(int i_) {
    rep(i,K) {
        rep(j,M[i_]) {
            if(l[i]==p[i_][j]) {
                goto go;
            }
        }
        return false;
go:;
    }
    return true;
}

void solve() {
    rep(i,103) {
        rep(j,103) p[i][j]=0;
        M[i]=0;
        l[i]=0;
    }
    rep(i,N) {
        cin>>M[i];
        rep(j,M[i]) {
            cin>>p[i][j];
        }
    }
    cin>>K;
    rep(i,K) cin>>l[i];

    int ans = 0;
    rep(i,N) {
        if(check(i)) {
            if(ans==0) ans=i+1;
            else ans = -1;
        }
    }
    if(ans==0) ans=-1;
    cout<<ans<<endl;
}

int main() {
    while(cin>>N) {
        if(!N) return 0;
        solve();
    }

    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF 1000000000
#define PI 3.14159265359
#define EPS 1e-12

int main(void) {
  while (true) {
    int n, p[105][105], m[105];
    cin >> n;
    if (!n)
      break;
    REP(i, n) {
      cin >> m[i];
      REP(j, m[i]) { cin >> p[i][j]; }
    }
    int k, l[105];
    cin >> k;
    REP(i, k) { cin >> l[i]; }

    int ans = 0;
    REP(i1, n) {
      int ret = 0;
      REP(i2, m[i1]) {
        REP(i3, k) {
          if (p[i1][i2] == l[i3])
            ret++;
        }
      }
      if (ret == k) {
        if (ans == 0)
          ans = i1 + 1;
        else
          ans = -1;
      }
    }
    if (ans == 0)
      ans = -1;

    cout << ans << endl;
  }
  return 0;
}