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 <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
	int n;
	while (cin >> n, n) {
		vector<set<int>> member(n);
		REP(i, n) {
			int m;
			cin >> m;
			REP(j, m) {
				int p;
				cin >> p;
				member[i].insert(p);
			}
		}
		int k;
		cin >> k;
		vector<int> num(k);
		int ans = -1;
		REP(i, k)
			cin >> num[i];
		REP(i, n) {
			bool b = true;
			REP(j, k) {

				if (member[i].find(num[j]) == member[i].end()) {
					b = false;
					break;
				}
			}
			if (b) {
				if (ans == -1)
					ans = i + 1;
				else {
					ans = -1;
					break;

				}

			}
		}
		cout << ans << endl;
	}
}

C++: #include <stdio.h>
#include <string.h>

#pragma warning(disable : 4996)

int N, M, K, P, L[100]; bool ok[100][100];

int main()
{
	while (true)
	{
		scanf("%d", &N);

		if (N == 0) break;

		memset(ok, false, sizeof(ok));

		for (int i = 0; i < N; i++)
		{
			scanf("%d", &M);

			for (int j = 0; j < M; j++)
			{
				scanf("%d", &P);

				ok[i][P - 1] = true;
			}
		}

		scanf("%d", &K);

		for (int i = 0; i < K; i++) scanf("%d", &L[i]);

		int count_ = 0, ptr = -1;

		for (int i = 0; i < N; i++)
		{
			bool flag = true;

			for (int j = 0; j < K; j++)
			{
				if (!ok[i][L[j] - 1])
				{
					flag = false; break;
				}
			}

			if (flag)
			{
				count_++; ptr = i + 1;
			}
		}

		printf("%d\n", count_ = 1 ? ptr : -1);
	}

	return 0;
}

C++: //
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015??´ 13B10694. All rights reserved.
//

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
    int n, in, m, k;
    while(cin>>n,n){
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            
            if(vec[i].size()==0&&vect.size()!=0)continue;
            int now=0;
            int j;
            for(j=0;j<vect.size();j++){
                int out =0;
                while(vect[j]>vec[i][now]){
                    now++;
                    if(now >= vec[i].size()){
                        out=1;
                        break;
                    }
                }
                
                if(vect[j]<vec[i][now]||out==1)
                    break;
                if(vect[j]==vec[i][now]){
                    now++;
                }
            }
            if(vect[vect.size()-1]==vec[i][now-1]){
                suc++;
                po = i+1;
            }
        }
        if(suc==1){
            cout<<po<<endl;
        }
        else{
            cout<<-1<<endl;
        }
    }
    
    return 0;
}

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

int m[101];
set<int> p[101];
int r[101];

int main() {
    int n,k,tmp;
    while(cin>>n, n) {
        for(int i=0; i<n; ++i) {
            p[i].clear();
            cin>>m[i];
            for(int j=0; j<m[i]; ++j) {
                cin>>tmp;
                p[i].insert(tmp);
            }
        }
        cin>>k;

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

        int ans = -1;
        for(int i=0; i<n; ++i) {
            bool same = true;
            for(int j=0; j<k; ++j) {
                if(p[i].find(r[j]) == p[i].end())
                    same = false;
            }

            if(same) {
                if(ans >= 0) ans = -2;
                if(ans == -1) ans = i+1;
            }
        }

        if(ans < 0) ans = -1;
        cout<<ans<<endl;
    }
}