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 <set>

using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::set;

bool intension(set<int> s1, set<int> s2) {
	if (s1.size() < s2.size()) {
		return false;
	}

	for (set<int>::iterator itr = s2.begin(); itr != s2.end(); ++itr) {
		if ((s1.find(*itr)) == s1.end()) {
			return false;
		}
	}
	return true;
}

int main(void) {
	int N;
	cin >> N;

	while (N != 0) {
		vector< set<int> > data(N+1);
		int cri = -1;
		int count = 0;
		int temp;
		int M;
		for (int i = 0; i < N+1; i++) {
			cin >> M;
			for (int j = 0; j < M; j++) { 
				cin >> temp;
				data[i].insert(temp);
			}
			
		}

		for (int i = 0; i < N; i++) {
			if (count < 2) {
				if (intension(data[i], data[N])) {
					cri = i+1;
					count++;
				}
			}
		}
		if (count > 1) {
			cout << -1 << endl;
		}
		else {
			cout << cri << endl;
		}

		cin >> N;
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;

bool know[101][101];

int main () {
    int n;
    while (cin >> n, n) {
        memset(know, 0, sizeof(know));
        for (int i = 1; i <= n; i++) {
            int m;
            cin >> m;
            for (int j = 1; j <= m; j++) {
                int p;
                cin >> p;
                know[i][p] = true;
            }
        }
        int k;
        cin >> k;
        vector<int> l(k);
        for (int i = 0; i < k; i++) {
            cin >> l[i];
        }

        queue<int> result;
        for (int i = 1; i <= n; i++) {
            bool out = true;
            for (int j = 0, size = l.size(); j < size; j++) {
                if (know[i][l[j]] == false) {
                    out = false;
                    break;
                }
            }
            if (out) {
                result.push(i);
            }
        }

        int out = -1;
        if (result.size() == 1) {
            out = result.front();
        }
        cout << out << endl;
    }
}

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

using std::cin;
using std::cout;
using std::endl;
using std::vector;

int main(void) {
	while (1) {
		int member_num;
		cin >> member_num;
		if (member_num == 0) {
			break;
		}

		vector<vector<int>> member_info;
		for (int i = 0; i < member_num; i++) {
			vector<int> info;
			int info_num;
			cin >> info_num;
			for (int j = 0; j < info_num; j++) {
				int tmp;
				cin >> tmp;
				info.push_back(tmp);
			}
			member_info.push_back(info);
		}

		int leak_num;
		cin >> leak_num;
		vector<int> leak;
		for (int i = 0; i < leak_num; i++) {
			int tmp;
			cin >> tmp;
			leak.push_back(tmp);
		}

		vector<bool> flag(member_num, true);
		int flag_num = member_num;
		for (auto leak_itr = leak.begin(); leak_itr != leak.end(); ++leak_itr) {
			for (int i = 0; i < member_num; i++) {
				if (!flag[i]) {
					continue;
				}

				bool hit = false;
				for (auto info_itr = member_info[i].begin(); info_itr != member_info[i].end(); ++info_itr) {
					if (*info_itr == *leak_itr) {
						hit = true;
						break;
					}
				}
				if (hit == false) {
					flag[i] = false;
					flag_num--;
				}
			}
		}

		if (flag_num != 1) {
			cout << -1 << endl;
		} else {
			for (int i = 0; i < member_num; i++) {
				if (flag[i]) {
					cout << i + 1 << endl;
					break;
				}
			}
		}
	}
	return 0;
}

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

using namespace std;

int main(){
	while(1){
		int n; cin >> n;
		if(!n) break;
		vector<vector<int> > lists(n);
		for(int i=0; i<n; i++){
			int m; cin >> m;
			lists[i].resize(m);
			for(int j=0; j<m; j++) cin >> lists[i][j];
			sort(lists[i].begin(), lists[i].end());
		}
		int k; cin >> k;
		vector<int> l(k);
		for(int i=0; i<k; i++) cin >> l[i];
		sort(l.begin(), l.end());

		int ans = -1;
		int candCount = 0;
		for(int i=0; i<n; i++){
			int idx = 0;
			for(int j=0; j<lists[i].size(); j++){
				if(idx == k) break;
				if(lists[i][j] == l[idx]) idx++;
			}
			if(idx == k){
				candCount++;
				ans = i+1;
			}
		}
		if(candCount==1){
			cout << ans << endl;
		} else{
			cout << -1 << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<list>
#include<vector>
#include<algorithm>
#include<string>
#include<stdio.h>

using namespace std;
using vec = vector<int>;
using mat = vector<vec>;
using lst = list<int>;


bool solve()
{
	int N;
	cin >> N;
	if (N == 0)return false;

	mat Info(N, vec(N, 0));

	for (int i = 0; i < N; ++i)
	{
		int M; cin >> M;

		for (int j = 0; j < M; ++j)
		{
			int p; cin >> p; --p;
			Info[i][p] = 1;
		}
	}

	int K;
	cin >> K;

	vec L(N, 0);

	for (int i = 0; i < K; ++i)
	{
		int l; cin >> l; --l;
		L[l] = 1;
	}

	int ans = -1;

	for (int i = 0; i < N; ++i)
	{
		for (int j = 0; j < N; ++j)
		{
			if (Info[i][j] == 0 && L[j] == 1)
			{
				break;
			}

			if (j == N - 1)
			{
				if (ans != -1)
				{
					cout << -1 << endl;
					return true;
				}
				ans = i + 1;
			}
		}
	}

	cout << ans << endl;
	
	return true;
}


int main()
{
	while(solve())
	{
	}

	return 0;
}