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 <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<eps)
int N;
vector<int> p[105];
vector<int> L;
int main()
{
	while(1)
	{
		for(int i=0;i<105;i++)p[i].clear();
		L.clear();
		cin >> N;
		if(N==0)break;
		for(int i=0;i<N;i++)
		{
			int k;
			cin >> k;
			for(int j=0;j<k;j++)
			{
				int a;
				cin >> a;
				p[i].pb(a);
			}
		}
		int k;
		cin >> k;
		for(int i=0;i<k;i++)
		{
			int a;
			cin >> a;
			L.pb(a);
		}
		sort(L.begin(),L.end());
		for(int i=0;i<N;i++)sort(p[i].begin(),p[i].end());
		int cnt = 0,num;
		for(int i=0;i<N;i++)
		{
			bool flag = true;
			for(int j=0;j<L.size();j++)
			{
				if(!(binary_search(p[i].begin(),p[i].end(),L[j])))
				{
					flag = false;
					break;
				}
			}
			if(flag)
			{
				cnt++;
				num = i+1;
			}
		}
		if(cnt!=1)cout << -1 << endl;
		else cout << num << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long

using namespace std;
int main(){
  int n;
  while(cin>>n,n){
    int po=-1;
    vector<vector<int> > vvi(n);
    for(int i=0;i<n;i++){
      int m;cin>>m;
      for(int j=0;j<m;j++){
	int a;cin>>a;
	vvi[i].pb(--a);
      }
    }
    int k;cin>>k;
    bool flag2[1000]={};
    for(int i=0;i<k;i++){
      int a;cin>>a;
      flag2[--a]=true;
    }
    int ans=0;
    for(int i=0;i<n;i++){
      //cout<<i<<endl;
      bool flag[1000]={};
      int cnt=0;
      for(int j=0;j<vvi[i].size();j++)
	flag[vvi[i][j]]=true;
      for(int j=0;j<1000;j++){
	if(flag[j]&&flag2[j])
	  cnt++;
      }
      if(cnt==k){
	//cout<<"!"<<" "<<i<<endl;
	ans++;
	po=i+1;
	//	break;
      }
    }
    if(ans==1)
      cout<<po<<endl;
    else
      cout<<-1<<endl;
  }
  return 0;
}

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

int main() {
	int N;
	while(cin >> N, N) {
		vector<vector<int> > v;
		v.resize(N);
		for(int i = 0; i < v.size(); i++) {
			v[i].resize(N);
			for(int j = 0; j < v[i].size(); j++)
				v[i][j] = 0;
			int M;
			cin >> M;
			for(int j = 0; j < M; j++) {
				int p;
				cin >> p; p--;
				v[i][p] = 1;
			}
		}
		vector<int> l;
		int K;
		cin >> K;
		for(int i = 0; i < K; i++) {
			int tmp;
			cin >> tmp; tmp--;
			l.push_back(tmp);
		}

		int res = -1;
		int cnts = 0;
		for(int i = 0; i < v.size(); i++) {
			int flg = true;
			for(int j = 0; j < l.size(); j++) {
				if(v[i][l[j]] == 0) flg = false;
			}
			if(flg) {
				res = i;
				cnts++;
			}
		}
		if(cnts == 1)
			cout << res+1 << endl;
		else
			cout << -1 << endl;
	}
}

C++: // AOJ 2399
#include<iostream>
#include<vector>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;

const int NMAX = 108;
bool KNOW[NMAX][NMAX], LEAK[NMAX];
int N, K;

void init() {
  REP(i, N) REP(j, N) {
    KNOW[i][j] = false;
  }
  REP(i, N) {
    LEAK[i] = false;
  }
}

bool can_leak(int suspect) {
  REP(l, N) {
    if ((not KNOW[suspect][l]) and LEAK[l]) {
      return false;
    }
  }

  return true;
}

int solve() {
  vector<int> suspects;

  REP(i, N) {
    if (can_leak(i)) {
      suspects.push_back(i);
    }
  }
  
  return (suspects.size() == 1 ? suspects[0] + 1 : -1);
}

int main() {
  while (cin >> N and N) {
    init();
    REP(i, N) {
      int M;
      cin >> M;
      REP(j, M) {
        int p;
        cin >> p;
        KNOW[i][--p] = true;
      }
    }

    cin >> K;
    REP(i, K) {
      int l;
      cin >> l;
      LEAK[--l] = true;
    }


    cout << solve() << endl;
  }
}