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;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

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

vector<int> v[110];
int ls[110];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    while(true){
        int N;
        std::cin >> N;
        if(!N){break;}
    
        for(int i=0;i<N;++i){
            v[i].clear();

            int M;
            std::cin >> M;

            for(int j=0;j<M;++j){
                int p;
                std::cin >> p;
                --p;
            
                v[i].emplace_back(p);
            }

            sort(v[i].begin(), v[i].end());
        }

        int K;
        std::cin >> K;

        for(int i=0;i<K;++i){
            std::cin >> ls[i];
            --ls[i];
        }

        vector<int> ss;
        for(int i=0;i<N;++i){
            bool ok = true;
            for(int j=0;j<K;++j){
                if(!binary_search(v[i].begin(), v[i].end(), ls[j])){
                    ok = false;
                    break;
                }
            }

            if(ok){
                ss.emplace_back(i);
            }
        }

        int res = ss.size() == 1 ? (ss[0] + 1) : -1;
        std::cout << res << std::endl;
    }
}

C++: // AOJ 2399

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

int main(void)
{
	int n;
	while (cin >> n, n){
		bool secret[n][n];
		int m, num;
		for (int i = 0; i < n; i++){
			fill(secret[i], secret[i] + n, false);
			cin >> m;
			for (int j = 0; j < m; j++){
				cin >> num;
				secret[i][num-1] = true;
			}
		}
		int k; cin >> k;
		bool leak[n]; fill(leak, leak + n, false);
		for (int i = 0; i < k; i++){
			cin >> num;
			leak[num-1] = true;
		}
		int cnt = 0, ret = 0;
		for (int i = 0; i < n; i++){
			bool flag = true;
			for (int j = 0; j < n; j++){
				if (!secret[i][j] && leak[j]) flag = false;
			}
			if (flag){
				cnt++;
				ret = i + 1;
			}
		}
		if (cnt == 1){
			cout << ret << endl;
		}
		else {
			cout << "-1" << endl;
		}
	}
	
	return 0;
}

C++: #include <cstdio>
#include <set>
#include <vector>
#include <algorithm>

template <typename Tp>
bool includes(std::set<Tp> const& x, std::set<Tp> const& y) {
  for (auto const& yi: y) if (!x.count(yi)) return false;
  return true;
}

int testcase_ends() {
  size_t N;
  scanf("%zu", &N);
  if (N == 0) return 1;

  std::vector<std::set<int>> p(N);
  for (auto& pi: p) {
    size_t M;
    scanf("%zu", &M);
    for (size_t i = 0; i < M; ++i) {
      int pp;
      scanf("%d", &pp);
      pi.insert(pp);
    }
  }

  size_t K;
  scanf("%zu", &K);

  std::set<int> l;
  for (size_t i = 0; i < K; ++i) {
    int ll;
    scanf("%d", &ll);
    l.insert(ll);
  }

  std::set<size_t> res;
  for (size_t i = 0; i < N; ++i) {
    if (includes(p[i], l)) res.insert(i+1);
  }
  if (res.size() != 1) return puts("-1"), 0;
  printf("%zu\n", *res.begin());
  return 0;
}

int main() {
  while (!testcase_ends()) {}
}

C++: #include <iostream>
using namespace std;
int main(){
  int n,m[101],p[101][100],k,l[100],i,j,b,a,cnt[101],max,who,flag;
  while(1){
    max=0;
    cin >> n;
    if(n==0) break;
    for(i=1;i<=n;i++){
      cin >> m[i];
      for(j=0;j<m[i];j++){
    cin >> p[i][j];
      }
    }
    cin >> k;
    for(i=0;i<k;i++){
      cin >> l[i];
    }
    for(i=1;i<=n;i++){
      for(j=0;j<m[i];j++){
    for(b=1;b<m[i];b++){
      if(p[i][b]<p[i][b-1]) swap(p[i][b],p[i][b-1]);
    }
      }
    }
    for(i=0;i<=k;i++){
      for(j=1;j<k;j++){
    if(l[j]<l[j-1])  swap(l[j],l[j-1]);
      }
    }
    for(i=1;i<=n;i++){
      cnt[i]=0;
      for(j=0;j<m[i];j++){
    for(a=0;a<k;a++){
      if(l[a]==p[i][j]){
        cnt[i]++;
      }
    }
      }
      if(cnt[i]>max) max=cnt[i];
    }
    who=0;
    flag=0;
    for(i=1;i<=n;i++){
    if(flag==0&&cnt[i]==max){
      who=i;
      flag=1;
    }
    else if(flag==1&&cnt[i]==max){
      flag=2;
      break;
    }
      if(flag==2) break;
    }
    if(max<k) cout << -1 << endl;
    else if(flag==1) cout << who << endl;
    else if(flag==2) cout << -1 << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main() {
  int n,i,j,c,q;
  while(cin>>n,n){
    int a[n+1][n]={0},k=0,p;
    for(i=0;i<=n;i++){
      for(cin>>a[i][0],j=1;j<=a[i][0];j++)cin>>a[i][j];
    }
  for(i=0;i<n;i++){
    for(q=j=1;j<=a[i][0];j++){
      if(a[n][q]==a[i][j])q++;
    }
    if(q-1==a[n][0]){
      k++;
      p=i+1;
    }
  }
  cout<<(k==1)?p:-1<<endl;
  }
}