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<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;


using namespace std;

int main()
{

  while(1){

    int n;
    cin >> n;

    if(n==0) break;

    vector<vector <int> > data;

    rep(i,n){
      int m;
      vector<int> tmp;
      cin >> m;
      rep(j,m){
        int p;
        cin >> p;
        tmp.push_back(p);
      }
      data.push_back(tmp);
    }

    int k,l;
    vector<int> k_data;
    cin >>k;
    rep(i,k){
      cin >> l;
      k_data.push_back(l);
    }

    rep(i,n){
      sort(data[i].begin(),data[i].end());
    }
    sort(k_data.begin(),k_data.end());

    bool flag[n];
    rep(i,n){
      flag[i]=true; 
      if(data[i].size()==0){flag[i]=false; continue;}
      rep(j,k_data.size()){
        int a = lower_bound(data[i].begin(),data[i].end(),k_data[j])-data[i].begin();
        if(data[i][a]!=k_data[j]){ flag[i]=false;break;}
      }
    }
    int count=0;
    rep(i,n){ if(flag[i]) count++;}


    if(count==1){
      rep(i,n){ if(flag[i]) cout << i+1 << endl;}
    }else{
      cout << -1 << endl;
    } 
  }
}

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

bool check(const vector<int>& know, const vector<int>& flowed){
    for(int i=0 ; i < flowed.size(); i++){
        bool match = false;
        for(int j=0; j < know.size(); j++){
            if(flowed[i] == know[j]){
                match = true;
                break;
            }
        }
        if(match == false)
            return false;
    }
    return true;
}

int main(void){
    int N;
    while(cin >> N, N){
        int M;
        vector< vector<int> > know;
        vector<int> flowed;
        vector<int> suspended;
        for(int i = 0; i < N; i++){
            cin >> M;
            know.push_back(vector<int>(0));
            for(int j=0; j < M; j++){
                int tmp; cin >> tmp;
                know[i].push_back(tmp);
            }
        }

        int K; cin >> K;
        for(int i=0 ; i < K; i++){
            int tmp; cin >> tmp;
            flowed.push_back(tmp);
        }

        for(int q=0; q < know.size(); q++){
            if(check(know[q], flowed)){
                suspended.push_back(q);
            }
        }

        if(suspended.size() == 1){
            cout << suspended[0] + 1 << endl;
        }else{
            cout << -1 << endl;
        }
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<ll,pll> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-11;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

int n;

int main(){
	while(1){
		cin>>n;
		if(n==0) break;
		vvi a(n,vi(n));
		for(int i=0;i<n;i++){
			int m;
			cin>>m;
			for(int j=0;j<m;j++){
				int x;
				cin>>x;
				a[i][x-1]++;
			}
		}
		int m;
		cin>>m;
		vi b(m);
		for(int i=0;i<m;i++){
			cin>>b[i];
			b[i]--;
		}
		vi c;
		for(int i=0;i<n;i++){
			bool flag=1;
			for(auto j:b) if(!a[i][j]) flag=0;
			if(flag) c.push_back(i+1);
		}
		if(c.size()==1) cout<<c[0]<<endl;
		else cout<<-1<<endl;
	}
}

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 =(tmp << (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 =(tmp << (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;
  
}