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++: //
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015??´ 13B10694. All rights reserved.
//

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
    int n, in, m, k;
    while(cin>>n,n){
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            if(vec[i].size()==0)continue;
            int now=0;
            int j;
            for(j=0;j<vect.size();j++){
                int out =0;
                while(vect[j]>vec[i][now]){
                    now++;
                    if(now >= vec[i].size()){
                        out=1;
                        break;
                    }
                }
                
                if(vect[j]<vec[i][now]||out==1)
                    break;
                if(vect[j]==vec[i][now]){
                    now++;
                }
            }
            if(vect[vect.size()-1]==vec[i][now-1]){
                suc++;
                po = i+1;
            }
        }
        if(suc==1){
            cout<<po<<endl;
        }
        else{
            cout<<-1<<endl;
        }
    }
    
    return 0;
}

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

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 <cstdio>
#include <iostream>
#include <cmath>
#include <cstring> 
#include <algorithm>

using namespace std;

int main()
{
	int n;
	while(1){
		cin >> n;
		if(n == 0) break;
		int a[101][101]={0}, m, p;
		for(int i = 1; i <= n; i++){
			cin >> m;
			for(int j = 0; j < m; j++){
				cin >> p;
				a[i][p] = 1;
			}
		}
		int b[201], k, ans=0;
		cin >> k;
		for(int l = 0; l < k; l++){
			cin >> b[l];
		}
		for(int s = 1; s <= n; s++){
			for(int t = 0; t < k; t++){
				if(a[s][b[t]] != 1) break;
				if(t == k-1){
					if(ans == 0) ans = s;
					else ans = -1;
				}
			}
		}
		if(ans == 0) ans = -1;
		cout << ans << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstring>

using namespace std;

int main(){
	int N;
	int valid[100];
	int know[100][100];
	while(cin >> N, N){
		memset(know, 0, sizeof(know));
		for(int i=0;i<N;i++){
			int M; cin >> M;
			for(int j=0;j<M;j++){
				int c; cin >> c;
				know[i][c-1] = 1;
			}
		}
		for(int i=0;i<N;i++) valid[i] = 1;
		int K; cin >> K;
		for(int i=0;i<K;i++){
			int c; cin >> c; c--;
			for(int j=0;j<N;j++){
				if(!know[j][c]) valid[j] = 0;
			}
		}
		int res = -1;
		bool ok = true;
		for(int i=0;i<N;i++){
			if(valid[i]){
				if(res != -1) ok = false;
				res = i+1;
			}
		}
		cout << (ok ? res : -1) << endl;
	}
}

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

int main(){
  int N,K,ans;
  int p[100][100];
  int l[100];

  while(true){
    cin >> N;
    if(N == 0) break;

    int *M = new int[N];
    
    for(int i=0;i<N;++i){
      cin >> M[i];

    
      for(int ix=0;ix<M[i];++ix){
	cin >> p[i][ix];
      }
    }
    
    cin >> K;
    
    for(int i=0;i<K;++i)
      cin >> l[i];
    
    
    int cnt = 0;
    for(int i=0;i<N;++i){
      if(K>M[i]) continue;
      if(M[i] == 0) continue;
      
      bool w = true;
      for(int k=0;k<K;++k){
	for(int ix = 0; ix<M[i]; ++ix){
	  if(l[k] == p[i][ix]){
	    break;
	  }
	  if(ix == M[i] - 1) w = false;
	}
	if(!w) break;
      }
      
      if(w) {
	++cnt;
	ans = i;

      }
    }

    if(cnt == 1){
      cout << ans + 1 << endl;
    }else{
      cout << -1 << endl;
    }

    delete[] M;

  }
  
  return 0;
}