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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;

bool contains(vector<int>& a, vector<int>& b) {
    for(int& i : b) {
        if(find(begin(a), end(a), i) == end(a)) return false;
    }
    return true;
}

int main() {
    int n;
    vector<int> p[100];
    vector<int> l;
    while(true) {
        cin >> n;
        if(n == 0) break;
        for(int i = 0; i < n; ++i) {
            int m; cin >> m;
            p[i].resize(m);
            for(int j = 0; j < m; ++j) {
                cin >> p[i][j];
                p[i][j];
            }
        }
        int k; cin >> k;
        l.resize(k);
        for(int i = 0; i < k; ++i) {
            cin >> l[i];
        }

        vector<int> ans = vector<int>();
        for(int i = 0; i < n; ++i) {
            if(contains(p[i], l)) {
                ans.push_back(i);
            }
        }
        cout << (ans.size() == 1 ? ans[0] + 1 : -1) << endl;
    }
    return 0;
}

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

using namespace std;

const int MAX = 101;
vector<int> V[MAX];
vector<int> Leak;
int N;


void solve(){
  sort(Leak.begin(),Leak.end());
  int ans = 0;
  for(int i = 1; i <= N; i++){
    bool flg = true;
    sort(V[i].begin(),V[i].end());
    for(int j = 0; j < Leak.size(); j++)
      if(!binary_search(V[i].begin(),V[i].end(),Leak[j])){
	flg = false;
	break;
      }
    if(flg && !ans) ans = i;
    else if(flg) ans = -1;
  }
  if(ans == 0) ans = -1;
  cout << ans << endl;
}

void init(){
  for(int i = 0; i < MAX; i++)
    V[i].clear();
  Leak.clear();
}
int main(){
  while(cin >> N && N){
    init();
    int in;
    for(int i = 1; i <= N; i++){
      int num;
      cin >> num;
      for(int j = 0; j < num; j++){
	cin >> in;
	V[i].push_back(in);
      }
    }
    cin >> in;
    while(in--){
      int a;
      cin >> a;
      Leak.push_back(a);
    }
    solve();
  }
  return 0;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<cstring>
#include<utility>
#include<set>
#include<stack>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int>PI;
using namespace std;
#define MAX  999999
int main(){
    int n;
    while(cin>> n,n){
        vi array(1000,0); bool check = false; int ans = 0; int hoge = -INF;;
        vi num(1000,0); vi size(1000,0);
        vi z;
        vvi v(1000,vi(1000,0));
        rep(i,n){cin >> size[i]; rep(j,size[i])cin >> v[i][j];}
        int temp; cin>>temp; vi u(temp+1,0);
        rep(i,temp) cin >> u[i];
        rep(i,n){
            rep(j,v[i].size()){
                rep(k,temp){
                    if(v[i][j] == u[k]){array[i]++; num[u[k]]+=1;}
                }
            }
            if(hoge < array[i]){hoge = array[i];ans = i;}
        }
        //cout << ans <<"array value is :"<<hoge<< endl;
        /*judgement all element*/
        rep(i,size[ans]){
            if(v[ans][i]!= INF){
                //cout << v[ans][i]; cout << endl;
                //cout << num[v[ans][i]]; cout << endl;
                if(num[v[ans][i]] == 1){check = true;break;}
            }
        }
        if(check == true) cout << ans+1 << endl;
        else  cout << -1 << endl;
    }
}

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

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

    vector<vector<int> > p(N);
    for (int i = 0; i < N; ++i) {
      int M;
      cin >> M;
      for (int j = 0; j < M; ++j) {
	int pij;
	cin >> pij;
	p[i].push_back(pij);
      }
    }

    int K;
    cin >> K;
    vector<int> l(K);
    for (int i = 0; i < K; ++i)
      cin >> l[i];

    int ans = 0;
    for (int i = 0; i < N; ++i) {
      int cnt = 0;
      for (int j = 0; j < K; ++j) {
	for (unsigned int k = 0; k < p[i].size(); ++k) {
	  if (l[j] == p[i][k])
	    ++cnt;
	}
      }
      if (cnt == K) {
	if (ans == 0)
	  ans = i+1;
	else
	  ans = -1;
      }
    }

    if (ans == 0)
      ans = -1;
    cout << ans << endl;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define int long long
#define pb push_back 
#define pf push_front 
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )
#define All(v) v.begin(), v.end()
 
typedef pair<int, int> Pii; typedef pair<int, Pii> Pip;
const int INF = 1107110711071107;
 
signed main() {
  int N;  
  while ( cin >> N, N ) {
    int M, K;
    int l[101];
    bool used[101][101] = {{0}};
 
    Rep(i, N) {
      cin >> M;
      Rep(j, M) {
    int p;
    cin >> p;
    p--;
    used[i][p] = true;
      }
    }
 
    cin >> K;
    Rep(i, K) {
      cin >> l[i];
      l[i]--;
    }
 
    int ans = -2;
    bool flag = false;
    Rep(i, N) {
      int cnt = 0;
      Rep(j, K) {
    if ( used[i][l[j]] ) cnt++;
      }
      if ( cnt == K ) {
    if ( flag ) {
      ans = -2;
    } else {
      ans = i;
      flag = true;
    }
      }
    }
 
    cout << ans+1 << endl;
  }
}