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++: #define _USE_MATH_DEFINES
#include <bits/stdc++.h>

using namespace std;

// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

// container util
#define all(x) (x).begin(), (x).end()

// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                         \
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
       << " " << __FILE__ << endl;

// typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;

// constant
const int MOD = (int)1e9 + 7;
const int INF = (int)1e18;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};

// conversion
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

//
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
//

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

  int n;
  while (cin >> n, n) {
    int m[111], k;
    vector<vector<int>> p(n, vector<int>(111));
    rep(i, n) {
      cin >> m[i];
      rep(j, m[i]) { cin >> p[i][j]; }
    }
    cin >> k;
    vector<int> l(k);
    rep(i, k) cin >> l[i];

    int ans = -2;
    rep(i, n) {
      bool ok = true;
      vector<bool> used(m[i], true);
      rep(f, k) {
        bool flag = false;
        rep(j, m[i]) {
          if (l[f] == p[i][j] && used[j]) {
            flag = true;
            used[j] = false;
          }
        }
        ok &= flag;
      }
      if (ok) {
        if (ans == -2)
          ans = i + 1;
        else
          ans = -1;
      }
    }
    if (ans == -2) ans = -1;
    cout << ans << "\n";
  }

  return 0;
}

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

using namespace std;

#define MAX_N 101

bool include(const vector<int> &a, const vector<int> &b) {
	for (int i = 0; i < b.size(); i++) {
		bool found = false;
		for (int j = 0; j < a.size(); j++) {
			if (b[i] == a[j]) found = true;
		}
		if (!found) return false;
	}
	return true;
}

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

		vector<int> know[MAX_N];
		for (int i = 1; i <= N; i++) {
			int M; cin >> M;
			for (int j = 0; j < M; j++) {
				int p; cin >> p;
				know[i].push_back(p);
			}
		}

		int K; cin >> K;
		vector<int> leak(K);
		for (int i = 0; i < K; i++) cin >> leak[i];
		
		vector<int> suspect;
		for (int i = 1; i <= N; i++) 
			if (include(know[i], leak)) suspect.push_back(i);

		if (suspect.size() == 1) 
			cout << suspect[0] << endl;
		else 
			cout << -1 << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}

int a[1000][1000];
int main(){
  while(1){
    lp(i,1000){
      lp(j,1000){
	a[i][j]=0;
      }
    }
    
    int n;
    cin>>n;
    if(n==0) break;
    int b,d;
    lp(i,n){
      cin>>b;
      lp(j,b){
	cin>>d;
	a[i][d]=1;
      }
    }
    int count=0,ans=0,check;
    int c;
    cin>>c;
    int x[1000];
    lpin(x,i,c);
    lp(i,n){
      check=0;
      lp(j,c){
	if(a[i][x[j]]==1) 1;
	else check=1;
      }
      if(check==0){
	ans=i;
	count++;
      }
    }
    if(count==1) cout<<ans+1<<endl;
    else cout<<"-1"<<endl;
  }
  return 0;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#pragma warning(disable:4996)
using namespace std;

const int My_Inf=2147483647;
const long long int My_LInf=9223372036854775807;

int main() {
	while (1) {
		int N; cin >> N;
		vector<vector<bool>>knows(N, vector<bool>(N));
		for (int i = 0; i < N; ++i) {

			int M; cin >> M;
			for (int j = 0; j < M; ++j) {
				int p; cin >> p;
				p--;
				knows[i][p] = true;
			}
		}
		int M; cin >> M;
		vector<int>leaks;
		for (int i = 0; i < M; ++i) {
			int k; cin >> k;
			k--;
			leaks.push_back(k);
		}
		int ans = -1;
		for (int i = 0; i < N; ++i) {
			bool ok = true;
			for (int j= 0; j < M; ++j) {
				if (!knows[i][leaks[j]])ok = false;
				
			}
			if (ok) {
				if (ans == -1) {

					ans = i + 1;
				}
				else {
					ans = -1;
					break;
				}
			}
		}
		cout << ans << endl;
	}

	return 0;
}