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++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std; 

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;
 
int main()
{
	while(1) {
		int n, m, k;
		cin >> n;
		if (!n) break;
		set<int> p[101];
		rep(i,0,n) {
			cin >> m;
			rep(j,0,m) {
				int t; 
				cin >> t;
				p[i].insert(t);
			}
		}
		Vi l;
		cin >> k;
		rep(i,0,k) {
			int t;
			cin >> t;
			l.pb(t);
		}

		
		Vi  f;
		rep(i,0,n) {
			bool f2 = true;
			rep(j,0,k) {
				auto it = lower_bound(all(p[i]),l[j]);
				if (it == p[i].end()) {
					f2 = false;
					break;
				}
			}
			if (f2) f.pb(i);
		}
		if (len(f) == 1) cout << f[0]+1 << endl;
		else cout << -1 << endl;
	}
	

	return 0;
}

C++: #include<bits/stdc++.h>
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;
			scanf("%d", &c);
			for (int d = 0; d < c; d++) {
				int e;
				scanf("%d", &e);
				e--;
				V[e].push_back(b);
			}
		}
		int x;
		scanf("%d", &x);
		for (int y = 0; y < x; y++) {
			int z;
			scanf("%d", &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 <cstdio>
#include <algorithm>

using namespace std;

int N;
int M[101], P[101][101];
int K, L[101];

int main() {
  while (true) {
    scanf("%d", &N);
    if (N == 0) break;
    for (int i=0;i<N;i++) {
      scanf("%d", &M[i]);
      for (int j=0;j<M[i];j++) scanf("%d", &P[i][j]);
    }
    scanf("%d", &K);
    for (int i=0;i<K;i++) scanf("%d", &L[i]);
    int ans = -1;
    for (int i=0;i<N;i++) {
      if (M[i] < K) continue;
      bool ok = true;
      for (int j=0;j<K;j++) {
        const int* p = find(P[i], P[i]+M[i], L[j]);
        if (p == P[i]+M[i]) {
          ok = false;
          break;
        }
      }
      if (ok) {
        if (ans >= 0) {
          ans = -1;
          break;
        }
        ans = i+1;
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}

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

using namespace std;

int main()
{
    while (true) {
        int n;
        cin >> n;
        if (n == 0) {
            break;
        }

        vector<vector<int>> v;
        for (int i = 0; i < n; ++i) {
            int m;
            cin >> m;
            vector<int> t;
            for (int j = 0; j < m; ++j) {
                int p;
                cin >> p;
                t.push_back(p);
            }
            sort(begin(t), end(t));
            v.push_back(t);
        }
        int k;
        cin >> k;
        vector<int> ks;
        for (int i = 0; i < k; ++i) {
            int l;
            cin >> l;
            ks.push_back(l);
        }
        sort(begin(ks), end(ks));

        int count = 0;
        int id = -1;
        for (int i = 0; i < n; ++i) {
            if (includes(begin(v[i]), end(v[i]), begin(ks), end(ks))) {
                count += 1;
                id = i;
            }
        }

        if (count == 1) {
            cout << (id + 1) << endl;
        }
        else {
            cout << -1 << endl;
        }
    }
}

C++: #include <bits/stdc++.h>

#define int             long long
#define FOR( i, m, n )  for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n )     FOR( i, 0, n )
#define REPR( i, m )    for( int (i) = (m); (i) >= 0; (i)-- )
#define REPONE( i, n )  FOR( i, 1, n + 1 )
#define ALL( a )        (a).begin(), (a).end()
#define MP              make_pair

using namespace std;
using P = pair<int, int>;

template<class T>bool chmax( T& a, const T& b ) { if( a < b ) { a = b; return 1; } return 0; }
template<class T>bool chmin( T& a, const T& b ) { if( a > b ) { a = b; return 1; } return 0; }

const int INF = 1e9;
const int MOD = 1e9 + 7;

signed main(){
    int N;
    while( cin >> N, N ){
        vector<set<int> > pe( N );
        set<int> ans;

        REP( i, N ){
            int M; cin >> M;
            REP( j, M ){
                int p; cin >> p;
                pe[i].insert( p );
            }

            ans.insert( i );
        }

        int K; cin >> K;
        vector<int> li( K );
        REP( i, K ){
            int l; cin >> l;
            li[i] = l;
        }


        REP( i, N ){
            REP( j, li.size() ){
                if( pe[i].find( li[j] ) != pe[i].end() ) continue;
                ans.erase( i );
            }
        }

        if( ans.size() == 1 ) for( auto v : ans ) cout << v + 1 << endl;
        else cout << -1 << endl;
    }
}