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<cstdio>

using namespace std;

int N,K;
int M[108],p[108][108],l[108];

void init(){
  for(int i=0;i<108;i++){
    M[i]=0;
    l[i]=0;
    for(int j=0;j<108;j++){
      p[i][j]=0;
    }
  }
}

int solve(){
  bool flg=false;
  int res;

  for(int i=0;i<N;i++){
    bool cookies[108];
    for(int q=0;q<108;q++)
      cookies[q]=false;
    for(int j=0;j<K;j++){
      for(int g=0;g<M[i];g++){
        if(l[j]==p[i][g]){
          cookies[l[j]]=true;
        }
      }
    }
    bool flg2=true;
    for(int k=0;k<K;k++){
      if(cookies[l[k]]==false)
        flg2=false;
    }
    if(flg2==true && flg==true) return -1;
    else if(flg2==true && flg==false){
      flg=true;
      res=i+1;
    }
  }

  if(flg==false) return -1;
  if(flg==true) return res;

}

int main(){
  while(1){
    init();
    scanf("%d",&N);
    if(N==0) break;
    for(int i=0;i<N;i++){
      scanf("%d",&M[i]);
      for(int j=0;j<M[i];j++){
        scanf("%d",&p[i][j]);
      }
    }
    scanf("%d",&K);
    for(int i=0;i<K;i++)
      scanf("%d",&l[i]);

    printf("%d\n",solve());

  }
  return 0;
}

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

#define loop(n, i) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;

using namespace std;
typedef long long ll;

int is_include(vector<int> as, vector <int> bs) {
    for (auto a : as) {
        if (find(all(bs), a) == bs.end()) return 0;
    }
    return 1;
}

int main()
{
    int n;
    while (cin >> n, n) {
        vector<vector<int>> pss;
        pss.resize(n);
        loop (n, i) {
            int m; cin >> m;
            pss[i].resize(m);
            loop(m, j) {
                int tmp; cin >> tmp;
                pss[i][j] = tmp;
            }
        }
        vector<int> ks;
        int k; cin >> k;
        loop (k, i) { int tmp; cin >> tmp; ks.push_back(tmp); }

        int ans = -1;
        int count = 1;
        for (auto ps : pss) {
            if (is_include(ks, ps)) {
                if (ans == -1) {
                    ans = count;
                } else {
                    ans = -1;
                    break;
                }
            }
            count++;
        }
        cout << ans << endl;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int main(){
	while(1){
		int n,k;
		int cdata[101];
		cin >> n;
		if(n==0) break;
		vector<int> data[101];
		REP(i,n){
			int m;
			cin >> m;
			REP(j,m){
				int tmp;
				cin >> tmp;
				data[i].pb(tmp);
			}
			sort(All(data[i]));
		}
		cin >> k;
		REP(i,k) cin >> cdata[i];
		sort(cdata,cdata+k);
		bool flag;
		int cnt = 0;
		int ans;
		REP(i,n){
			flag = true;
			REP(j,k){
				if(!binary_search(data[i].begin(),data[i].end(),cdata[j])) flag = false;
			}
			if(flag){
				cnt++;
				ans = i+1;
			}
		}
		if(cnt==1){
			cout << ans << endl;
		}else{
			cout << -1 << endl;
		}

	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;


int main(){
    
    while(true){
    int N; cin>>N;
        if(N==0)break;
    vector< set<int> > p;
    REP(i,N){
        int M; cin>>M;
        set<int> pt;
        REP(j,M){
            int t; cin>>t;
            pt.insert(t);
        }
        p.push_back(pt);
    }
    
    int K; cin>>K;
    vector<int> l(K);
    REP(i,K)cin>>l[i];
    
    int cnt=0,id=-1;
    REP(i,N){
        REP(j,l.size()){
            if(p[i].find(l[j])==p[i].end())goto nextf;
        }
        id=i;
        cnt++;
    nextf:;
    }
    
    if(cnt==0||cnt>1)cout<<-1<<endl;
    else cout<<id+1<<endl;
    }
    
    return 0;
}