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 <vector>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
using namespace std;

int N, M, P, K, L;
bool T[200][200];

int main(void) {
  while(cin >> N, N) {
    REP(i, 0, 200) REP(j, 0, 200) T[i][j] = false;
    REP(i, 1, N + 1) {
      cin >> M;
      REP(j, 0, M) {
        cin >> P;
        T[i][P] = true;
      }
    }

    cin >> K;
    vector<int> R;
    REP(i, 0, K) {
      cin >> L;
      R.push_back(L);
    }

    int ans = -1;
    REP(i, 1, N + 1) {
      bool f = true;
      REP(j, 0, R.size()) if(!T[i][R[j]]) f = false;
      if(f) {
        if(ans == -1) ans = i;
        else {
          ans = -1;
          goto END;
        }
      }
    }

END: cout << ans << endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(void){
    int n;
    while (cin>>n) {
        if (n==0) {
            break;
        }
        int m,a;
        std::vector<vector<int>> vec(110,vector<int>(110));
        for (int i=0;i<110;i++) {
            for (int j=0;j<110;j++) {
                vec[i][j]=0;
            }
        }
        for (int i=1;i<=n;i++) {
            cin>>m;
            for (int j=0;j<m;j++) {
                cin>>a;
                vec[i][a]=1;
            }
        }
        int k;
        std::deque<int> deq;
        cin>>k;
        for (int i=0;i<k;i++) {
            cin>>a;
            deq.emplace_back(a);
        }
        int ans=0;
        for (int i=1;i<=n;i++) {
            int count=0;
            for (int j=0;j<k;j++) {
                if (vec[i][deq[j]]==1) {
                    count++;
                } else {
                   break; 
                }
            }
            if (count==k) {
                if (ans==0) {
                    ans=i;
                } else {
                    ans=-1;
                }
            }
        }
        if (ans!=0&&ans!=-1) {
            cout<<ans<<endl;
        } else if (ans==0||ans==-1) {
            cout<<-1<<endl;
        }
    }
}

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

using namespace std;

#define rep(i, n) for(int i = 0;i < int(n); ++i)

vector<int> a[111];
vector<int> l;

int main() {
  int n;
  for (;;){
    cin >> n;
    if (n == 0) break;
    rep (i, n) {
      int m;
      a[i].clear();
      cin >> m;
      rep (j, m) {
	int p;
	cin >> p;
	a[i].push_back(p);
      }
    }
    int k;
    cin >> k;
    l.clear();
    rep (i, k) {
      int ll;
      cin >> ll;
      l.push_back(ll);
    }
    int res = -1;
    rep (i, n) {
      rep (j, k) {
	bool ok = false;
	rep (ii, a[i].size()) if (a[i][ii] == l[j]) ok = true;
	if (!ok)goto aaa;
      }
      if (res == -1) res = i;
      else {res = -1;break;}
    aaa:;
    }
    if (res >= 0) ++res;
    cout << res << endl;
  }
}

C++: #include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
//cin.sync_with_stdio(false);
//streambuf
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
using vi = vector<int>;
using vpii = vector<pii>;
template<class T, class T2> using umap = unordered_map<T, T2>;
template<class T> using uset = unordered_set<T>;
#define ALL(a) a.begin(),a.end()
#define rep(i,a) for(int i=0;i<a;i++)
#define rep1(i,a) for(int i=1;i<=a;i++)
int main() {
	int n;
	while (cin >> n,n) {
		vector<vector<int>> buf(n);
		for (auto &a : buf) {
			int m;
			cin >> m;
			while (m--) {
				int b;
				cin >> b;
				a.push_back(b);
			}
			sort(ALL(a));
		}
		vi l;
		int m;
		cin >> m;
		while (m--) {
			int b;
			cin >> b;
			l.push_back(b);
		}
		int cnt = 0;
		int ans;
		rep(i, buf.size()) {
			auto &a = buf[i];
			bool f = 1;
			for (auto b : l) {
				if (!binary_search(ALL(a), b)) {
					f = 0;
					break;
				}
			}
			if (f) {
				cnt++;
				ans = i;
			}
		}
		cout << (cnt == 1 ? ans + 1 : -1) << endl;
	}
}

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

#define loop(n, i) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;

using namespace std;
typedef long long ll;

int is_include(vector<int> as, vector <int> bs) {
    for (auto a : as) {
        if (find(all(bs), a) == bs.end()) return 0;
    }
    return 1;
}

int main()
{
    int n;
    while (cin >> n, n) {
        vector<vector<int>> pss;
        pss.resize(n);
        loop (n, i) {
            int m; cin >> m;
            pss[i].resize(m);
            loop(m, j) {
                int tmp; cin >> tmp;
                pss[i][j] = tmp;
            }
        }
        vector<int> ks;
        int k; cin >> k;
        loop (k, i) { int tmp; cin >> tmp; ks.push_back(tmp); }

        int ans = -1;
        int count = 1;
        for (auto ps : pss) {
            if (is_include(ks, ps)) {
                if (ans == -1) {
                    ans = count;
                } else {
                    ans = -1;
                    break;
                }
            }
            count++;
        }
        cout << ans << endl;
    }
}