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 <bits/stdc++.h>
using namespace std;
int main(){
  int i,j,k,h,x,q,n,c,p[101][101],l[101];
  while(cin>>n,n){
    for(i=1;i<=n;i++)
      for(cin>>p[i][0],j=1;j<=p[i][0];j++)
        cin>>p[i][j];
    for(cin>>k,q=i=0;i<k;i++)cin>>l[i];
    for(i=1;i<=n;i++){
      for(c=0,j=1;j<=p[i][0];j++){
        if(p[i][0]<k)break;
        for(h=0;h<k;h++)if(p[i][j]==l[h])c++;
      }
      if(c==k){
        if(q==1){q=0;break;}
        x=i;q=1;
      }
    }
    if(!q)cout<<-1<<endl;
    else cout<<x<<endl;
  }
}

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

const int MAX_N = 100;

int main() {
    for(int N; cin >> N, N; ) {
        vector<int> G[MAX_N];
        for(int i = 0; i < N; i++) {
            int M; cin >> M;
            while(M--) {
                int p; cin >> p; p--;
                G[p].push_back(i);
            }
        }

        int K; cin >> K;
        vector<int> A(N, 0);
        for(int i = 0; i < K; i++) {
            int l; cin >> l; l--;
            for(int j = 0; j < (int)G[l].size(); j++) {
                A[G[l][j]]++;
            }
        }

        vector<int> res;
        for(int i = 0; i < N; i++) if(A[i] == K) res.push_back(i + 1);
        // for(int i = 0; i < N; i++) cerr << A[i] << endl;
        if(res.size() == 1) cout << *res.begin() << endl;
        else cout << -1 << endl;
    }
}

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

#define loop(n, i) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;

using namespace std;
typedef long long ll;

int is_include(vector<int> as, vector <int> bs) {
    for (auto a : as) {
        if (find(all(bs), a) == bs.end()) return 0;
    }
    return 1;
}

int main()
{
    int n;
    while (cin >> n, n) {
        vector<vector<int>> pss;
        pss.resize(n);
        loop (n, i) {
            int m; cin >> m;
            pss[i].resize(m);
            loop(m, j) {
                int tmp; cin >> tmp;
                pss[i][j] = tmp;
            }
        }
        vector<int> ks;
        int k; cin >> k;
        loop (k, i) { int tmp; cin >> tmp; ks.push_back(tmp); }

        int ans = -1;
        int count = 1;
        for (auto ps : pss) {
            if (is_include(ks, ps)) {
                if (ans == -1) {
                    ans = count;
                } else {
                    ans = -1;
                    break;
                }
            }
            count++;
        }
        cout << ans << endl;
    }
}

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

using namespace std;

int main(void){
	
	int n,m;
	
	while(cin >> n,n){
		vector<int>v[101];
		for(int i=0;i<n;i++){
			cin >> m;
			int a;
			for(int j=0;j<m;j++){
				cin >> a;
				v[i].push_back(a);
			}
			sort(v[i].begin(),v[i].end());
		}
		int k;
		cin >> k;
		vector<int>l(k);
		for(int i=0;i<k;i++)cin >> l[i];
		
		int ans=0,id=-1;
		for(int i=0;i<n;i++){
			bool fg=true;
			for(int j=0;j<l.size();j++)
				if(!binary_search(v[i].begin(),v[i].end(),l[j]))fg=false;
			if(fg)ans++,id=i;
		}
		if(ans==1)cout << id+1 << endl;
		else cout << -1 << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()

int main()
{

    while (1)
    {
        int n;
        cin >> n;
        if (n == 0)
            return 0;
        set<int> v[100];
        rep(i, n)
        {
            int m;
            cin >> m;
            rep(j, m)
            {
                int p;
                cin >> p;
                v[i].insert(p);
            }
        }
        int k;
        cin >> k;
        vector<int> l(k);
        rep(i, k) cin >> l[i];
        int cnt = 0, num;
        rep(i, n)
        {
            bool b = true;
            for (auto li : l)
            {
                if (!v[i].count(li))
                {
                    b = false;
                    break;
                }
            }
            if (b)
            {
                cnt++;
                num = i + 1;
            }
        }
        cout << (cnt == 1 ? num : -1) << "\n";
    }
}