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<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<iomanip>
#include<set>
#include<numeric>
#include<sstream>
#include<random>
#include<cassert>
#include<list>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {1, 1, 0, -1, -1, 0};
int dx[] = {1, 0, -1, -1, 0, 1};
#define ceil(a, b) a / b + !!(a % b)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)

int main() {
    int n;
    while (cin >> n && n) {
        int m[n];
        vector<int> v[n];
        rep(i, n) {
            cin >> m[i];
            rep(j, m[i]) {
                int tmp;
                cin >> tmp;
                v[i].push_back(tmp);
            }
            sort(v[i].begin(), v[i].end());
        }
        int k;
        cin >> k;
        int l[k];
        rep(i, k) cin >> l[i];
        sort(l, l + k);
        vector<int> ans;
        /*
        rep(i, n) {
            rep(j, v[i].size()) cout << v[i][j] << " ";
            cout << endl;
        }
         */
        rep(i, n) {
            /*
            int table[k];
            rep(i, k) table[k] = 0;
             */
            int key = 0;
            rep(j, v[i].size()) {
                if (v[i][j] == l[key]) {
                    key++;
                   // cout << key << endl;
                }
            }
            if (key == k) ans.push_back(i);
        }
        //rep(i, ans.size()) cout << ans[i] << " "; cout << endl;
        if (ans.size() == 1) cout << ans[0] + 1 << endl;
        else cout << -1 << endl;
    }
}

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

int graf[114][114];

int main() {
	int n;
	while (cin >> n, n) {
		for (int i = 0; i < 100; i++)
			for (int j = 0; j < 100; j++)graf[i][j] = 0;

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

		int k[100];
		int b;
		cin >> b;
		for (int i = 0; i < b; i++)cin >> k[i];

		vector<int>v;
		for (int i = 0; i < n; i++) {
			int flg = 0;
			for (int j = 0; j < b; j++) {
				if (!graf[i][k[j]])flg = 1;
			}
			if (flg == 0)v.push_back(i);
		}
		if (v.size() == 1)cout << v[0] +1<< endl;
		else cout << -1 << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <cassert>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <array>
#include <bitset>

using namespace std;

#define all(c) begin(c), end(c)
#define dump(c) cerr << "> " << #c << " = " << (c) << endl
#define REP(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)

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

const int INF = 1001001001;
const double EPS = 1e-10;


template<typename T1,typename T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p){
  return os << '(' << p.first <<',' << p.second << ')';
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& a){
  os << '[';
  rep(i,a.size()) os << (i ? " " : "") << a[i];
  return os << ']';
}

int main() {
  for(int N; cin >> N, N != 0; ) {
    bitset<100> ps[100];
    rep(i, N) {
      int M; cin >> M;
      rep(j, M) {
        int p; cin >> p;
        ps[i][p - 1] = 1;
      }
    }
    bitset<100> ls;
    int K; cin >> K;
    rep(i, K) {
      int l; cin >> l;
      ls[l - 1] = 1;
    }

    int cnt = 0;
    int ans = -1;
    rep(i, N) {
      if ((ps[i] | ls) == ps[i]) {
        cnt++;
        ans = i;
      }
    }

    if (cnt == 1) cout << ans + 1 << endl;
    else cout << -1 << endl;
  }
  
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
  int n;
  while(cin >> n, n){
    vector<vector<int> > v;
    vector<int> l;
    v.resize(n);
    int m, k, info;
    for(int i = 0; i < n; i++){
      cin >> m;
      for(int j = 0; j < m; j++){
        cin >> info;
        v[i].push_back(info);
      }
    }
    cin >> k;
    for(int i = 0; i < k; i++){
      cin >> info;
      l.push_back(info);
    }
    int cri = 0, ans = 0;
    for(int i = 0; i < n; i++){
      if(v[i].size() == 0) continue;
      int cnt = 0;
      for(int j = 0; j < v[i].size(); j++){
        for(int t = 0; t < l.size(); t++){
          if(v[i][j] == l[t]) cnt++;
        }
      }
      if(cnt == l.size()){
        cri++;
        ans = i + 1;
      }
    }
    cout << (cri != 1 ? -1 : ans) << endl;
  }
  return 0;
}