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 <stdio.h>
#include <algorithm>

using namespace std;


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

bool input() {
  int i, j;

  scanf("%d", &N);
  if (!N) return false;
  for (i = 0; i < N; i++) {
    scanf("%d", &M[i]);
    for (j = 0; j < M[i]; j++) {
      scanf("%d", &p[i][j]);
    }
  }
  scanf("%d", &K);
  for (i = 0; i < K; i++) {
    scanf("%d", &l[i]);
  }

  return true;
}

int main() {
    int i, j, k, out;

    while (input()) {
      out = -1;
      for (i = 0; i < N; i++) {
        for (j = 0; j < K; j++) {
          for (k = 0; k < M[i]; k++) {
            if (l[j] == p[i][k]) break;
          }
          if (k == M[i]) break;
        }
        if (j == K) {
          if (out == -1) out = i + 1;
          else {
            out = -1;
            break;
          }
        }
      }
      printf("%d\n", out);

    }
    return 0;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<cstring>
#include<utility>
#include<set>
#include<stack>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int>PI;
using namespace std;
#define MAX  999999
int main(){
    int n;
    while(cin>> n,n){
        vi array(1000,0); bool check = false; int ans = 0; int hoge = -INF;;
        vi num(1000,0); vi size(1000,0);
        vi z;
        vvi v(1000,vi(1000,0));
        rep(i,n){cin >> size[i]; rep(j,size[i])cin >> v[i][j];}
        int temp; cin>>temp; vi u(temp+1,0);
        rep(i,temp) cin >> u[i];
        rep(i,n){
            rep(j,v[i].size()){
                rep(k,temp){
                    if(v[i][j] == u[k]){array[i]++; num[u[k]]+=1;}
                }
            }
            if(hoge < array[i]){hoge = array[i];ans = i;}
        }
        //cout << ans <<"array value is :"<<hoge<< endl;
        /*judgement all element*/
        rep(i,size[ans]){
            if(v[ans][i]!= 0){
                //cout << v[ans][i]; cout << endl;
                //cout << num[v[ans][i]]; cout << endl;
                if(num[v[ans][i]] == 1){check = true;}
            }
        }
        if(check == true) cout << ans+1 << endl;
        else  cout << -1 << endl;
    }
}

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

int main(){
	int n;
	while(1){
		cin >> n;
		if(n == 0){
			break;
		}
	
		int m[100];
		int p[100][100];
		int k;
		int l[100];
		bool man[100];
		queue<int> mannom;

		for(int i = 0; i < n; i ++){
			cin >> m[i];
			for(int j = 0; j < m[i]; j++){
				cin >> p[i][j];
			}
		}
		cin >> k;
		for(int i = 0; i < k; i++){
			cin >> l[i];
		}	//input

		//犯人捜し
		int know = 0;
		for(int i = 0; i < n; i++){	//人数
			
			for(int a = 0; a < m[i]; a++){	//知っている情報　漏えいした情報を知っている情報と比べる
				for(int j = 0; j < k; j++){	//漏えい
					if(l[j] == p[i][a]){
						know ++;
					}
				}
			}

			if(know == k){
				man[i] = true;
				know = 0;
			}else{
				man[i] = false;
				know = 0;
			}

		}

		int nom = 0;
		for(int i = 0; i < n; i++){
			if(man[i] == true){
				nom ++;
				mannom.push(i);
			}
		}

		if(nom == 1){
			cout << mannom.front()+1 <<endl;
		}else{
			cout << -1 << endl;
		}
	}
	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int N, K;
bool rec[110][110];

signed main() {
    while(cin >> N, N) {
        memset(rec, false, sizeof(rec));
        rep(i,0,N) {
            int M; cin >> M;
            rep(j,0,M) {
                int inp; cin >> inp; inp--;
                rec[i][inp] = true;
            }
        }
        cin >> K;
        vector<int> vs(K);
        rep(i,0,K) cin >> vs[i], vs[i]--;

        int cnt = 0, ans = -1;
        rep(i,0,N) {
            bool ok = true;
            rep(j,0,K) {
                int v = vs[j];
                if(!rec[i][v]) ok = false;
            }
            if(ok) {
                cnt++;
                ans = i+1;
                // printf("ok: %lld\n", i+1);
            }
        }
        if(cnt != 1) cout << -1 << endl;
        else cout << ans << endl;
    }
    return 0;
}