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;

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define pb            push_back
template<class T, class S> inline pair<T, S> mp(T x, S y){ return make_pair(x, y); }
template<class T, class S> inline bool minup(T& m, S x){ return m>(T)x ? (m=(T)x, true) : false; }
template<class T, class S> inline bool maxup(T& m, S x){ return m<(T)x ? (m=(T)x, true) : false; }

static const int    INF = 1000000000;
static const ll     MOD = 1000000007LL;
static const double EPS = 1E-12;

int N, M;
bool flag[200][200];
int p;
int K;

int main()
{
  while(cin >> N, N){
    rep(i, 200) rep(j, 200) flag[i][j] = false;
    rep(i, N){
      cin >> M;
      rep(j, M){
        cin >> p;
        flag[i][p - 1] = true;
      }
    }
    cin >> K;
    vi l(K);
    rep(i, K){
      cin >> l[i];
      l[i] -= 1;
    }

    int cnt = 0;
    int res;
    rep(i, N){
      bool ok = true;
      vrep(v, l) ok &= flag[i][*v];
      if(ok){
        cnt += 1;
        res = i + 1;
      }
    }
    printf("%d\n", cnt == 1 ? res : -1);
  }

  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
string IntToString(int);
int StringToInt(string);
int main(){
  while(1){
    int n;
    cin >> n;
    if(n == 0)break;
    vector<int> M(n);
    vector<bitset<101> > P(n,bitset<101>(0));
    for(int i = 0;i < n;i++){
      cin >> M[i];
      for(int j = 0;j < M[i];j++){
	int tmp;
	cin >> tmp;
	bitset<101> tmp_bit(1);
	tmp_bit =(tmp_bit << (tmp-1));
	P[i] = (P[i] | tmp_bit);
      }
      cout << P[i] << endl;
    }

    int more_n;
    cin >> more_n;
    bitset<101> more(0);
    for(int i = 0;i < more_n;i++){
      int tmp;
      cin >> tmp;
      bitset<101> tmp_bit(1);
      tmp_bit =(tmp_bit << (tmp-1));
      more = (more | tmp_bit);
    }
    int flag = 0;
    int ans;
    for(int i = 0;i < n;i++){
      if((P[i] & more) == more){
	ans = i+1;
	flag++;
      }
    }
    if(flag == 1)cout << ans << endl;
    else cout << "-1" << endl;
    
  }
  return 0;   
}
string IntToString(int number){
  stringstream ss;
  ss << number;
  return ss.str();
}
int StringToInt(string number){
  stringstream ss;
  ss << number;
  int numInt;
  ss >> numInt;
  return numInt;
  
}

C++: //Save Your Privacy!
#include<bits/stdc++.h>
using namespace std;

vector< vector<int> > v;
vector<int> l;

vector<int> solve(){
  vector<int> ret;
  for(int i=0; i<v.size(); i++){
    bool flag=true;
    if(v[i].size()==0)flag=false;
    for(int j=0; j<l.size()&&flag; j++){
      for(int k=0; k<v[i].size(); k++){
        if(l[j]==v[i][k])break;
        if(k==v[i].size()-1){flag=false;}
      }
    }
    if(flag)ret.push_back(i);
  }
  return ret;
}

int main(){
  int N;
  while(true){
    cin>>N;
    if(N==0)break;
    v.clear();
    l.clear();
    for(int i=0; i<N; i++){
      int M;
      vector<int> tmp;
      cin>>M;
      for(int j=0; j<M; j++){
        int t;
        cin>>t;
        tmp.push_back(t);
      }
      sort(tmp.begin(), tmp.end());
      v.push_back(tmp);
    }
    int K;
    cin>>K;
    for(int i=0; i<K; i++){
      int t;
      cin>>t;
      l.push_back(t);
    }
    vector<int> p=solve();
    if(p.size()==1)cout<<p[0]+1<<endl;
    else cout<<"-1"<<endl;
  }
  return 0;
}