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<fstream>
#include<vector>
#include<stack>

using namespace std;

int main() {
	//ifstream fin("in.txt");

	int n = 0;

	while (cin >> n) {

		if (n == 0)break;

		//???????????\???
		vector<vector<int> > member;

		for (int i = 0; i < n; i++) {

			int num = 0;
			cin >> num;

			vector<int> piece;

			for (int i = 0; i < num; i++) {
				int tmp = 0;
				cin >> tmp;
				piece.push_back(tmp);
			}
			member.push_back(piece);
		}

		int k = 0; 
		cin >> k;

		vector<int> ans;

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

		//???????????\????????????

		int ansNum = 0;
		bool same = false;

		for (int i = 0; i < member.size(); i++) {
			if (ans.size() <= member[i].size()) {
				for (int j = 0; j < ans.size(); j++) {
					same = false;
					for (int k = 0; k < member[i].size(); k++)
						if (ans[j] == member[i][k])same = true;
					if (same)continue;
					else break;
				}
				if (same) {
					if(ansNum == 0)ansNum = i + 1;
					else ansNum = -1;
				}
			}
		}
		if (ansNum == 0)ansNum = -1;

		cout << ansNum << endl;

	}


	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for(auto i=(m).begin();i!=(m).end();i++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())

typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;

const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1 << 30;

template<typename T>
void printv(vector<T> const& s) {
  REP(i, SZ(s)) {
    cout << s[i] << " ";
  }
  cout << endl;
}

int main () {
  cin.tie(0);
  cout << setprecision(10);

  while(1) {
    int n; cin >> n;
    if(n == 0) break;
    vvi p(n);
    REP(i, n) {
      int m; cin >> m;
      p[i].resize(m);
      REP(j, m) {
        cin >> p[i][j];
      }
      sort(ALL(p[i]));
    }
    int k; cin >> k;
    vi l(k);
    REP(i, k) cin >> l[i];
    sort(ALL(l));

    int ans = -1;
    REP(i, n) {
      bool ok = true;
      int ltmp = 0;
      int j = 0;
      while(ltmp < k) {
        if(j >= SZ(p[i]) || l[ltmp] < p[i][j]) {
          ok = false;
          break;
        } else if(l[ltmp] == p[i][j]) {
          ltmp++;
          j++;
        } else {
          j++;
        }
      }
      if(ok && ans == -1) ans = i+1;
      else if(ok) {
        ans = -1;
        break;
      }
    }
    cout << ans << endl;
  }
}

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();
        //cout << a << endl;
        //cout << i << " " << j << endl; 
        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;continue;}
    }else{
      cout << -1 << endl;
    } 
  }
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int N;
  int a,b;
  int r[100];
  int s[100];
  int p[100][100];
  int sum;
  int c;
  int check;
  while(1){
    c=0;
    check=0;
    for(int i=0;i<100;i++){
      for(int j=0;j<100;j++){
	p[i][j]=0;
      }
    }
    cin>>N;
    if(N==0) break;
    for(int i=0;i<N;i++){
      cin>>a;
      if(a==0) continue;
      for(int j=0;j<a;j++){
	cin>>b;
	p[i][b-1]=1;
      }
    }
    for(int i=0;i<N;i++){
      sum=0;
      for(int j=0;j<N;j++){
	sum+=p[j][i];
      }
      r[i]=sum;
    }
    cin>>a;
    for(int i=0;i<a;i++){
      cin>>b;
      if(r[b-1]==1){
	for(int j=0;j<N;j++){
	  if(p[j][b-1]==1){
	    if(check==j+1) break;
	    check=j+1;
	    c++;
	    break;
	  }
	}
      }
    }
    if(c!=1) cout<<-1<<endl;
    else cout<<check<<endl;
    /*for(int i=0;i<N;i++){
      for(int j=0;j<N;j++){
	cout<<p[i][j];
      }
      cout<<endl;
      }*/
    }
  return 0;
}