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<string>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)
typedef __int64 ll;


int main() {
	int n;
	while(cin >> n, n) {
		vector<vector<int> > ms(n, vector<int>());
		for(int i = 0; i < n; i++) {
			int m;
			cin >> m;
			for(int j = 0; j < m; j++) {
				int mss;
				cin >> mss;
				mss--;
				ms[i].push_back(mss);
			}
		}
		int k;
		cin >> k;
		vector<int> led(n);
		for(int i = 0; i < k; i++) {
			int j;
			cin >> j;
			j--;
			led[j] = 1;
		}
		// fill one
		int kouho = -1;
		for(int i = 0; i < n; i++) {
			int count = 0;
			for(int j = 0; j < ms[i].size(); j++) {
				if(led[ms[i][j]]) count++;
			}
			if (count == k) {
				if (kouho != -1) {
					cout << -1 << endl;
					goto end_loop;
				}
				kouho = i;
			}
		}
		// fill some
		for(int i = 0; i < n; i++) {
			if (i == kouho) continue;
			int count = 0;
			for(int j = 0; j < ms[i].size(); j++) {
				if(led[ms[i][j]]) count++;
			}
			if (count == ms[i].size()) {
				for(int j = 0; j < ms[i].size(); j++) {
					led[ms[i][j]] = 2;
					//cout << "sum" << ms[i][j] << endl;
				}
			}
		}
		
		bool summable = true;
		for(int i = 0; i < n; i++) {
			if (led[i] == 1) {
				summable = false;
				break;
			}
		}
		if (summable || kouho == -1) {
			cout << -1 << endl;
		}
		else {
			cout << kouho+1 << endl;
		}
		
		end_loop: {}
	}
	
	return 0;
}

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

using namespace std;

bool check(set<int>& info, vector<int>& data){
  for(int i=0; i<data.size(); ++i){
    if(info.find(data[i]) == info.end()) return false;
  }
  return true;
}

int solve(vector< set<int> >& info, vector<int>& data){
  vector<int> ans;
  for(int i=0; i<info.size(); ++i){
    if(check(info[i], data)) ans.push_back(i+1);
  }
  if(ans.size() == 1) return ans[0];
  else return -1;
}

int main(){
  int n, m, x;
  while(1){
    cin >> n;
    if(!n) break;

    vector< set<int> > info(n, set<int>());
    for(int i=0; i<n; ++i){
      cin >> m;
      for(int j=0; j<m; ++j){
	cin >> x;
	info[i].insert(x);
      }
    }

    cin >> m;
    vector<int> data(m, 0);
    for(int i=0; i<m; ++i) cin >> data[i];

    cout << solve(info, data) << endl;
  }
  return 0;
}

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

int main(){
  int n;
  while(std::cin >> n, n){
    vector<set<int> > vs(n);
    set<int> hoge;
    int k, tmp;
    for (int i = 0; i < n; i++) {
      std::cin >> k;
      for (int j = 0; j < k; j++) {
        std::cin >> tmp;
        vs[i].insert(tmp);
      }
    }
    std::cin >> k;
    for (int i = 0; i < k; i++) {
      std::cin >> tmp;
      hoge.insert(tmp);
    }
    int ans = -1;
    for (int i = 0; i < n; i++) {
      bool flag = true;
      for (int j: hoge) {
        flag &= (vs[i].find(j) != vs[i].end());
      }
      if(flag){
        if(ans == -1)ans = i + 1;
        else ans = -100;
      }
    }
    if(ans == -100 or ans == -1){
      std::cout << -1 << std::endl;
    }else{
      std::cout << ans << std::endl;
    }
  }
  return 0;
}

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

// bad knowhow
#define REP(i,n) for(long long i=0;i<(long long)n;++i)

#include <set>
set<int> g_p[100];
set<int> g_leak;

int main() {
	while (true) {
		int n;
		cin >> n;
		REP(i, 100) g_p[i].clear();
		g_leak.clear();
		if (n==0) break;
		REP(i, n) {
			int m;
			cin >> m;
			REP(j, m) {
				int p;
				cin >> p; --p;
				g_p[i].insert(p);
			}
		}
		int k;
		cin >> k;

		REP(i, k) {
			int l;
			cin >> l;
			--l;
			g_leak.insert(l);
		}

		int suspect = -2;
		for (int i = 0; i < n; ++i) {
			auto it = g_leak.begin();
			for (; it!=g_leak.end();++it) {
				if(g_p[i].count(*it)==0) break;
			}
			if (it==g_leak.end()){
				if (suspect == -2) suspect = i;
				else{
					suspect = -2;
					break;
				}
			};
		}

		cout << suspect + 1 << endl;
	}
}