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>
using namespace std;





int main(){
  while(1){


  
  int n;
  cin>>n;
  if(n==0){break;}
  int p;
  int a[1000][1000]={};
  for(int i=0;i<=n;i++){
    int m;
    cin>>m;
    a[i][0]=m;
    for(int t=1;t<=m;t++){
      cin>>a[i][t];
    }
    sort(&a[i][1],&a[i][m+1]);
  }
  
  int c=0,list[10000]={};
  for(int i=0;i<n;i++){
    for(int t=1;t<=a[i][0];t++){
      if(a[n][1]<a[i][t]){break;}
      if(a[n][1]==a[i][t]){list[c]=i; c++;}
    }
  }

  for(int i=1;i<=a[n][0];i++){
    for(int k=0;k<c;k++){
      if(list[k]==-1){break;}
      bool j=true;
      for(int t=1;t<=a[list[k]][0];t++){
	if(a[n][i]==a[list[k]][t]){j=false; break;}
	if(a[n][i]<a[list[k]][t]){break;}
      }
	if(j){list[k]=-1;}
    }
  }
    
    int count=0;
    int ans=-1;
    for(int k=0;k<c;k++){
      if(list[k]!=-1){ans=list[k]+1; count++;}
      if(count==2){ans=-1; break;}
    }

    cout<<ans<<endl;

  



  }
    
  return 0;
}

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

using namespace std;

int main()
{
    int n;
    while(cin >> n, n)
    {
        bool r[n+1][n+1];
        for(int i=1; i<=n; i++)
        {
            int m;
            cin >> m;
            while(m--)
            {
                int p;
                cin >> p;
                r[i][p] = true;
            }
        }
        int k;
        cin >> k;
        int ls[k];
        for(int i=0; i<k; i++) cin >> ls[i];
        vector<int> s;
        for(int i=1; i<=n; i++)
        {
            bool su = true;
            for(int j=0; j<k; j++)
            {
                if(!r[i][ls[j]])
                {
                    su = false;
                    break;
                }
            }
            if(su) s.push_back(i);
        }
        cout << (s.size()==1 ? s[0] : -1) << endl;
    }

}

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

using namespace std;


int main(){
	int count;
	set <int> data[101];
	while (1){
		cin >> count;
		if (!count)break;
		for (size_t i = 0; i < count; i++)
		{
			int count2;
			cin >> count2;
			for (size_t j = 0; j < count2; j++)
			{
				int data2;
				cin >> data2;
				data[i].insert(data2);
			}
			data[i].insert(1000);
		}
		int count3;
		cin >> count3;
		int a[101];
		for (size_t i = 0; i < count3; i++)
		{
			int data3;
			cin >> data3;
			a[i] = data3;
		}
		int whois=-1;
		int count4 = 0;
		for (size_t i = 0; i < count; i++)
		{
			bool f = 1;
			for (size_t j = 0; j < count3; j++)
			{
				if (data[i].find(a[j]) == data[i].end()){
					//cout << a[j] << endl;
					f = 0;
					break;
				}
			}
			if (f){
				count4++;
				whois = i + 1;
			}
		}
		if (count4 == 1){
			cout << whois << endl;
		}
		else{
			cout << -1 << endl;
		}
		//cout << count4 << whois << endl;
	}
	return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#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 ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n)  { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x)         { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
	int n;
	while (cin >> n, n) {
		vector<set<int>> member(n);
		REP(i, n) {
			int m;
			cin >> m;
			REP(j, m) {
				int p;
				cin >> p;
				member[i].insert(p);
			}
		}
		int k;
		cin >> k;
		vector<int> num(k);
		int ans = -1;
		REP(i, k)
			cin>>num[i];
		REP(i, k) {
			int cnt = -1;
			REP(j, n) {
				if (member[j].find(num[i]) != member[j].end()) {
					if (cnt == -1)
						cnt = j + 1;
					else {
						cnt = -1;
						break;
					}
				}
			}
			if (cnt != -1) {
				ans = cnt;
				break;
			}
		}
		cout << ans << endl;
	}
}