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 <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <complex>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
const int INF = 1<<28;


int main() {
	int n;
	while(cin >> n, n) {
		vector< vector<int> > f;
		REP(i, n) {
			int m; cin >> m;
			vector<int> hoge;
			REP(j, m) {
				int in; cin >> in;
				hoge.push_back(in);
			}
			sort(hoge.begin(), hoge.end());
			f.push_back(hoge);
		}
		int k; cin >> k;
		int cnt, ans = 0;
		vector<int> l;
		REP(i, k) {
			int in; cin >> in;
			l.push_back(in);
		}
//		sort(l.begin(), l.end());

//		REP(i, n) REP(j, f[i].size()) cout << i << ' ' << j << ' ' << f[i][j] << endl;
		REP(i, f.size()) {
			cnt = 0;
			REP(j, f[i].size()) {
				if(f[i][j] == l[cnt])
					cnt++; 
				if(cnt == k) {
					if(!ans) ans = i+1;
					else ans = -1;
					break;
				}
			}
		}
		if(ans == 0) ans = -1;
		cout << ans << endl;
	}
	return 0;
}

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

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) x.begin(),x.end()

bool solve(vi user,vi a){
    bool ret=true;
    rep(i,a.size()){
        if(find(all(user),a[i])==user.end())ret=false;
    }
    return ret;
}


int main(){
    int n;
    while(cin>>n){
        vi user[1000];
        vi loss;
        if(n==0)break;
        rep(i,n){
            int z;
            cin>>z;
            rep(j,z){
                int tmp;
                cin>>tmp;
                user[i].pb(tmp);
            }
            sort(all(user[i]));
        }
        int k;
        cin>>k;
        rep(i,k){
            int tmp;
            cin>>tmp;
            loss.pb(tmp);
        }
        int count=0;
        int ans=-1;
        rep(i,n){
            if(solve(user[i],loss)){
                count++;
                ans=i;
            }
        }
        if(count==1){
            cout<<ans+1<<endl;
        }
        else cout<<"-1"<<endl;
        
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
  int n;
  while(cin>>n,n){
    int a[n+2][n+2]={0},m;
    r(i,n+1){
      cin>>m;
      r(j,m)cin>>a[i][j];
      sort(a[i],a[i]+m);
    }
    int c=0,p,x=0,u,ans=0;
    r(i,n){p=0;
      for(int j=0;a[i][j]!=0&&101>a[i][j];j++){
        if(a[i][j]==a[n][p])p++;
      }
      if(p==m){
        x++;
        ans=i;
      }
    }
    if(x==1)cout<<ans+1<<endl;
    else cout<<-1<<endl;
  }
}

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;
		if (!N)break;
		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;
}

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

int main () {
    int N;
    while(cin >> N, N) {
        vector<set<int>> v(N);
        for(int i=0; i<N; ++i) {
            int M;
            cin >> M;
            for(int j=0; j<M; ++j) {
                int p;
                cin >> p;
                v[i].insert(p);
            }
        }
        int K;
        cin >> K;
        set<int> s;
        for(int i=0; i<K; ++i) {
            int l;
            cin >> l;
            s.insert(l);
        }

        vector<int> ret;
        for(int i=0; i<N; ++i) {
            if(includes(v[i].begin(), v[i].end(), s.begin(), s.end())) {
                ret.push_back(i+1);
            }
        }

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

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];
      }
    }
    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){
	  if(l[k] == a[i][j]){
	    count[i]++;
	  }
	}
      }
    }
    rep(i,n) if(count[i]==K) ans.push_back(i+1);
    if(ans.size()==1) cout << ans.front() << endl;
    else cout << -1 << endl;
    ans.clear();
  }
  
  return 0;
}