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++: /*
 * 2399.cc: Save Your Privacy!
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<bitset>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100;

typedef long long ll;

const int INF = 1 << 30;
const ll LINF = 1LL << 60;

/* typedef */

typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;
typedef bitset<MAX_N> bsn;

/* global variables */

bsn ps[MAX_N];

/* subroutines */

/* main */

int main() {
  for (;;) {
    int n;
    cin >> n;
    if (n == 0) break;

    for (int i = 0; i < n; i++) ps[i].reset();

    for (int i = 0; i < n; i++) {
      int m;
      cin >> m;
      for (int j = 0; j < m; j++) {
	int pj;
	cin >> pj;
	pj--;
	ps[i].set(pj);
      }
      //printf("ps[%d]=", i); cout << ps[i].to_string() << endl;
    }

    bsn bls(0);
    int k;
    cin >> k;
    for (int i = 0; i < k; i++) {
      int li;
      cin >> li;
      li--;
      bls.set(li);
    }
    //cout << "bls=" << bls.to_string() << endl;

    int an = 0, ai = -1;
    
    for (int i = 0; i < n; i++)
      if ((bls & ps[i]) == bls) an++, ai = i;

    printf("%d\n", (an == 1) ? ai + 1 : -1);
  }

  return 0;
}

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

bool isAinB(vector<int>& a, vector<int>&b){
  if(a.empty()) return true;
  if(b.empty()) return false;
  unsigned int p=0;
  for(unsigned int i=0; i<a.size(); i++){
    while(p<b.size()){
      if(b[p]!=a[i]) p++;
      else break;
    }
  }
  if(p==b.size()) return false;
  else return true;
}
  

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

    vector<vector<int> > info(n+1);
    for(int i=0; i<n+1; i++){
      int m;
      cin >> m;
      for(int j=0; j<m; j++){
        int tmp;
        cin >> tmp;
        info[i].push_back(tmp);
        sort(info[i].begin(), info[i].end());
      }
    }

    int susp=-1;
    for(int i=0; i<n; i++){
      if(isAinB(info[n],info[i])){
        if(susp==-1){
          susp=i;
        }else{
          susp=-2;
        }
      }
    }

    if(susp==-1 || susp==-2){
      cout << -1 << endl;
    }else{
      cout << susp+1 << endl;
    }
    
  }
  return 0;
}

C++: #include<iostream>
#include<utility>
using namespace std;
bool comp[101][101];
int main(){
  int n;
  int num;
  while(cin>>n,n){
    memset(comp,0,sizeof(comp));
    for(int i=0;i<n;i++){
      cin>>num;
      for(int j=0;j<num;j++){
	int tmp; cin>>tmp;
	comp[i][tmp-1]=true;
      }
    }
    
    cin>>num;
    int list[num];
    int ans = -1;
    for(int i=0;i<num;i++){
      cin>>list[i];
      list[i]--;
    }
    for(int i=0;i<n;i++){
      bool match=true;
      for(int j=0;j<num;j++){
	if(comp[i][list[j]]==false){
	  match=false;
	  break;
	}
      }
	if(match==true){
	  if(ans==-1){
	    ans = i+1;
	  }else{
	    ans=-1;
	    break;
	  }
	}
      }
    cout << ans << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
bool comp[101][101];
int main(){
  int n;
  int num;
  while(cin>>n,n){
    
    for(int i=0;i<n;i++){
      cin>>num;
      for(int j=0;j<num;j++){
	int tmp; cin>>tmp;
	comp[i][tmp-1]=true;
      }
    }

    cin>>num;
    int list[num];
    for(int i=0;i<num;i++)cin>>list[i];

    int ans=-1;
    int cnt=0;
    for(int i=0;i<n;i++){

      for(int j=0;j<num;j++){
	//cout << "list["<<j<<"] = "<< list[j]-1<< endl;
	if(comp[i][list[j]-1]==false)break;
	if(j==num-1 && ans==-1){
	    ans=i+1;
	}else if(j == num-1){
	  ans=-10;
	  break;
	}
	if(ans==-10)break;
      }
    }
    if(ans!=-10){
      cout << ans << endl;
    }else{
      cout << -1 << endl;
    }
  }
  return 0;
}