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>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <complex>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
const int INF = 1<<28;

int main() {
	int n;
	while(cin >> n, n) {
    vector< vector<int> > f(n);
    REP(i, f.size()) {
			int m; cin >> m;
      f[i] = vector<int>(m);
			REP(j, m) cin >> f[i][j];
		}
		int k; cin >> k;
    vector<int> l(k);
		int cnt, ans = 0;
		REP(i, k) cin >> l[i];
		REP(i, n) {
			cnt = 0;
      REP(j, f[i].size()) {
				REP(idx, l.size()) if(f[i][j] == l[idx]) cnt++; 
				if(cnt == k) {
					if(!ans) ans = i + 1;
					else ans = -1;
					break;
				}
			}
		}
		if(ans == 0) ans = -1;
		cout << ans << endl;
	}
	return 0;
}

C++: // Undone
#include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
#define MOD 1000000007
using namespace std;
int P[200][200], L[200];
signed main() {
  int N;
  while (cin >> N, N) {
    for (int i = 0; i < 200; i++) {
      for (int j = 0; j < 200; j++) {
        P[i][j]=0;
      }
    }

    for (int i = 0; i < N; i++) {
      int M; cin >> M;
      for (int j = 0; j < M; j++) {
        int p; cin >> p;
        P[i][p] = 1;
      }
    }
    int K; cin >> K;
    for (int i = 0; i < K; i++) {
      cin >> L[i];
    }
    
    int ans = -1, cnt = 0;
    for (int i = 0; i < N; i++) {
      int flag = 1;
      for (int j = 0; j < K; j++) {
        if (P[i][L[j]] == 0) {
          flag = 0;
          break;
        }
      }
      if (flag) {
        cnt++;
        ans = i+1;
      }
    }
    
    if (cnt > 1) {
      cout << -1 << endl;
    } else {
      cout << ans << endl;
    }
  }
}

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

using namespace std;

int main()
{
  int n, m, s, t;
  bool a[101][101];
  int b[101];
  vector<int> vec;

  while(cin >> n && n){
    fill(&a[0][0], &a[101][0], false);
    fill(b, b+101, 0);

    for(int i = 1; i <= n; ++i){
      cin >> m;
      for(int j = 0; j < m; ++j){
	cin >> t;
	a[i][t] = true;
      }
    }
    cin >> t;
    for(int i = 0; i < t; ++i)
      cin >> b[i];

    for(int i = 1; i <= n; ++i){
      s = 0;
      for(int j = 0; j < t; ++j)
	if(a[i][b[j]]) ++s;
      if(t == s) vec.push_back(i);
    }

    if(vec.size() == 1) cout << vec[0] << endl;
    else cout << "-1" << endl;

    vec.clear();
  }

  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <complex>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
const int INF = 1<<28;

int main() {
	int n;
	while(cin >> n, n) {
    vector< vector<int> > f(n);
    REP(i, f.size()) {
			int m; cin >> m;
      f[i] = vector<int>(m);
			REP(j, m) cin >> f[i][j];
		}
		int k; cin >> k;
    vector<int> l(k);
		int cnt, ans = 0;
		REP(i, k) cin >> l[i];
		REP(i, n) {
			cnt = 0;
      REP(j, f[i].size()) {
				REP(idx, k) if(f[i][j] == l[idx]) cnt++; 
				if(cnt == k) {
					if(!ans) ans = i + 1;
					else ans = -1;
					break;
				}
			}
		}
		if(ans == 0) ans = -1;
		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;


using namespace std;

int main()
{

  while(1){

    int n;
    cin >> n;

    if(n==0) break;

    vector<vector <int> > data;

    rep(i,n){
      int m;
      vector<int> tmp;
      cin >> m;
      rep(j,m){
        int p;
        cin >> p;
        tmp.push_back(p);
      }
      data.push_back(tmp);
    }

    int k,l;
    vector<int> k_data;
    cin >>k;
    rep(i,k){
      cin >> l;
      k_data.push_back(l);
    }

    rep(i,n){
      sort(data[i].begin(),data[i].end());
    }
    sort(k_data.begin(),k_data.end());

    bool flag[n];
    rep(i,n){
      flag[i]=true; 
      if(data[i].size()==0){flag[i]=false; continue;}
      rep(j,k_data.size()){
        int a = lower_bound(data[i].begin(),data[i].end(),k_data[j])-data[i].begin();
        if(data[i][a]!=k_data[j]){ flag[i]=false;break;}
      }
    }
    int count=0;
    rep(i,n){ if(flag[i]) count++;}


    if(count==1){
      rep(i,n){ if(flag[i]) cout << i+1 << endl;}
    }else{
      cout << -1 << endl;
    } 
  }
}