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++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
void solve();
main { solve(); return 0; }
// clang-format on

void solve() {
  int n;
  while (cin >> n, n) {
    vvi v(n);
    rep(i, n) {
      int m;
      cin >> m;
      while (m--) {
        int p;
        cin >> p;
        v[i].pb(p);
      }
    }
    int k;
    cin >> k;
    vi w(k);
    rep(i, k) cin >> w[i];
    sort(all(w));
    int c = 0, p;
    rep(i, v.size()) {
      vi r;
      sort(all(v[i]));
      set_difference(all(w), all(v[i]), back_inserter(r));
      if (r.size() == 0) {
        c++;
        p = i;
      }
    }
    cout << (c == 1 ? p + 1 : -1) << endl;
  }
}

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

int main() {
	int a;
	while (cin >> a, a) {
		vector<int>V[100]{};
		bool hannin[100];
		memset(hannin,true, a);
		for (int b = 0; b < a; b++) {
			int c;
			cin >> c;
			for (int d = 0; d < c; d++) {
				int e;
				cin >> e;
				e--;
				V[e].push_back(b);
			}
		}
		int x;
		cin >> x;
		for (int y = 0; y < x; y++) {
			int z;
			cin >> z;
			z--;
			for (int i = 0,sum=0; i < a; i++) {
				if (sum < V[z].size() && V[z][sum] == i)sum++;
				else hannin[i] = false;
			}
		}
		int s = 0, l = 0;
		for (int k = 0; k < a; k++) {
			if (hannin[k]) { s++; l = k + 1; }
		}
		if (s == 1)cout << l << endl;
		else puts("-1");
	}
}

C++: #include<bits/stdc++.h>
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

int main() {
	int n;
	while (scanf("%d", &n), n) {
		bitset<100>b[100], t;
		rep(i, n) {
			int m; scanf("%d", &m);
			rep(j, m) {
				int p; scanf("%d", &p);
				b[i] |= bitset<100>(1) << p;
			}
		}
		int k; scanf("%d", &k);
		rep(i, k) {
			int l; scanf("%d", &l);
			t |= bitset<100>(1) << l;
		}
		bool ok = true;
		int id = -1;
		rep(i, n) {
			if ((b[i] | t) == b[i]) {
				if (id == -1)id = i + 1;
				else ok = false;
			}
		}
		if (ok)printf("%d\n", id);
		else puts("-1");
	}
}

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;
    } 
  }
}