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>
#define rep(i,n) for(int i=0; i<n; i++)
#define INF 100000000
using namespace std;
int main(){
  int n,m[150];
  int a[150][150];
  while(1){
    cin >> n;
    if(n==0) break;
    rep(i,n){
      cin >> m[i];
      rep(j,m[i]){
	cin >> a[i][j];
      }
    }/*
    rep(i,n){
      rep(j,m[i]){
	cout << a[i][j] << " ";
      }
      cout << endl;
      }*/
    int K,tmp;
    cin >> K;
    int l[150];
    vector<int> ans;
    int count[150]={};
    rep(i,K) cin >> l[i];
    rep(i,n){
      rep(j,m[i]){
	rep(k,K){
	  //cout << l[k] << " " << a[i][j] << endl; 
	  if(l[k] == a[i][j]){
	    count[i]++;
	  }
	  //cout << count << endl;
	}
	//if(count == m[i]) ans.push_back(i+1);
      }
    }
    rep(i,n) if(count[i]==K) ans.push_back(i+1);
    //rep(i,ans.size()) cout << ans[i] << " ";
    //cout << ans.size() << endl;
    if(ans.size()==1) cout << ans.front() << endl;
    else cout << -1 << endl;
    ans.clear();
  }
  
  return 0;
}

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

bool isAinB(vector<int>& a, vector<int>& b){
    if(b.empty()) return false;
    unsigned int look=0;
    for(unsigned int i=0; i<a.size(); i++){
        while(a[i]!=b[look]){
            look++;
            if(look>=b.size()){
                return false;
            }
        }
    }
    return true;
}
        

int main(){
    while(1){
        int n;
        cin >> n;
        if(n==0) break;

        vector<vector<int> > info(n+1);
        for(int i=0; i<n+1; i++){
            int m;
            cin >> m;
            info[i].resize(m);
            for(int j=0; j<m; j++){
                cin >> info[i][j];
            }
            sort(info[i].begin(), info[i].end());
        }

        int susp=0;
        for(int i=0; i<n; i++){
            if(isAinB(info[n],info[i])){
                if(susp==0){
                    susp=i+1;
                }else{
                    susp=-1;
                    break;
                }
            }
        }
        
        if(susp==0) susp=-1;
        cout << susp << endl;
    }
    return 0;
}

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

using namespace std;

typedef long long LL;
typedef vector<int>    VI;
typedef vector<bool>   VB;
typedef vector<string> VS;

#define MP make_pair
#define PB push_back
#define ALL(x)  (x).begin(),(x).end()
#define rep(i, N)  for (int i = 0; i < (int)(N); i++)
#define REP(i, init, N)  for (int i = (init); i < (int)(N); i++)
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

int n, m, k;
vector<VI> ps;
VI ls;

int calc(VI pp) {
	int sum = 0;
	rep (i, ls.size()) {
		bool flag = false;
		rep (j, pp.size()) {
			if (ls[i] == pp[j]) {
				flag = true;
				break;
			}
		}
		sum += flag;
	}
	return sum;
}

int solve() {
	VI cs(ps.size() + 1);
	REP (i, 1, ps.size()) {
		cs[i] = calc(ps[i]);
	}
	int ans = -1;
	REP (i, 1, cs.size()) {
		if (cs[i] == k) {
			if (ans != -1) return -1;
			else ans = i;
		}
	}
	return ans;
}

int main(void) {
	while (1) {
		ps.clear();
		ls.clear();
		cin >> n;
		if (n == 0) break;
		ps.resize(n + 1);
		REP (i, 1, n + 1) {
			int m;
			cin >> m;
			rep (j, m) {
				int p;
				cin >> p;
				ps[i].PB(p);
			}
		}
		cin >> k;
		rep (i, k) {
			int l;
			cin >> l;
			ls.PB(l);
		}
		cout << solve() << endl;
	}
    return 0;
}

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

using namespace std;

int main() {
	int n;
	while (cin >> n) {
		if (n == 0) {
			break;
		}
		vector< vector <int> > member(n+1, vector<int>(0));
		for (int i = 0; i < n; i++) {
			int m;
			cin >> m;
			int a;
			for (int j = 0; j < m; j++) {
				cin >> a;
				member[a].push_back(i+1);
			}
		}
		int k;
		cin >> k;
		vector<int> member2(n+1, 0);
		int b;
		for (int i = 0; i < k; i++) {
			cin >> b;
			for (int j = 0; j < member[b].size(); j++) {
				member2[member[b][j]]++;
			}
		}
		int counter = 0;
		int hannin;
		for (int i = 1; i < n+1; i++) {
			if (member2[i] == k) {
				counter++;
				hannin = i;
			}
		}
		if (counter == 1) {
			cout << hannin << endl;
		} else {
			cout << -1 << endl;
		}
	}
	return 0;
}

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

int main() {
  int n;
  while (cin >> n) {
    if (n == 0) {
      break;
    }
    int p[110][110];
    for (int i = 0; i < 110; i++) {
      for (int j = 0; j < 110; j++) {
        p[i][j] = 0;
      }
    }
    for (int i = 0; i < n; i++) {
      int m;
      cin >> m;
      for (int j = 0; j < m; j++) {
        int x;
        cin >> x;
        p[i][x] = 1;
      }
    }
    int k;
    cin >> k;
    vector<int> list(k);
    for (int i = 0; i < k; i++) {
      cin >> list[i];
    }
    int cnt = 0, ans = -1;
    for (int i = 0; i < n; i++) {
      bool flag = true;
      for (int j = 0; j < k; j++) {
        if (p[i][list[j]] == 0) {
          flag = false;
        }
      }
      if (flag) {
        cnt++;
        ans = i + 1;
      }
    }
    if (cnt == 1) {
      cout << ans << endl;
    }
    else {
      cout << -1 << endl;
    }
  }
  return 0;
}

C++: 3
2 2 3
1 1
1 1
2 2 3
3
2 2 3
1 3
1 2
1 2
5
3 1 3 4
4 1 3 4 5
2 1 3
2 1 2
0
3 1 3 5
3
2 2 1
1 1
1 2
3 3 2 1
0