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 <bits/stdc++.h>

using namespace std;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    while (cin >> n, n)
    {
        int suspected[n + 1] = {0};
        std::vector<int> owner[n + 1];
        for (int i = 1; i <= n; i++)
        {
            int m;
            cin >> m;
            for (int j = 0; j < m; j++)
            {
                int p;
                cin >> p;
                owner[p].push_back(i);
            }
        }
        int k;
        cin >> k;
        for (int i = 0; i < k; i++)
        {
            int idx;
            cin >> idx;
            int len = owner[idx].size();
            for (int i = 0; i < len; i++)
                suspected[owner[idx][i]]++;
        }
        int res = -1;
        bool humei = false;
        for (int i = 1; i <= n; i++)
        {
            if (suspected[i] == k)
            {
                if (res < 0)
                    res = i;
                else
                    humei = true;
            }
        }
        if (humei || res < 0)
            cout << -1 << endl;
        else
            cout << res << endl;
    }
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a)      memset((a),0,sizeof(a))
#define MCLR(a)     memset((a),-1,sizeof(a))
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI > VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int,int> PII;

const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;

const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

int main(){
	
	while(1){

		int n,m,p,l,f=0,x,k;
		cin >> n;
		if(n==0) break;

		/*?????°??£?¨?*/
		VI M;
		VVI pp(n);
		VI flag(n, 0);

		/*???????????\???*/
		for(int i=0; i<n; i++){
			cin >> m;
			M.PB(m);
			for(int j=0; j<m; j++){
				cin >> p;
				pp[i].PB(p);
			}
		}

		/*?????????????????\???*/
		cin >> k;
		VI L;
		for(int i=0; i< k; i++){
			cin >> l;
			L.PB(l);
		}

		/*????????????????????°???????????¨?????§*/
		for(int i=0; i<n; i++){
			flag[i]=0;
			if(k > M[i]) continue;
			for(int j=0; j < M[i];j++){
				for(int LL=0; LL<k; LL++){
					if(pp[i][j] == L[LL]){
						flag[i]++;
					}
				}
			}
		}

		/*?????????????????¨????????????????????????*/
		for(int i=0; i<n; i++){
			if(k == flag[i]){
				f++;
				x = i + 1;
			}
		}
		if(f ==1){
			cout << x << endl;
		}
		else
			cout << -1 << endl;

	}

	return 0;

}

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

int n, m, k, cnt, ans;
bool memo[105][105] = {0};
int l[105] = {0};

int main() {
  int i, j;
  while(1) {
    cin >> n;
    if(n == 0) break;
    cnt = 0;
    for(i = 1; i <= n; ++i)
      for(j = 1; j <= n; ++j) memo[i][j] = 0;
    for(i = 1; i <= n; ++i) {
      cin >> m;
      for(j = 0; j < m; ++j) {
        int x;
        cin >> x;
        memo[i][x] = 1;
      }
    }
    cin >> k;
    for(i = 0; i < k; ++i) cin >> l[i];
    for(i = 1; i <= n; ++i) {
      for(j = 0; j < k; ++j) {
        if(memo[i][l[j]] == 0) break;
        if(j == k - 1) {
          ++cnt;
          ans = i;
        }
      }
      if(cnt > 1) break;
    }
    if(cnt == 1)
      cout << ans << endl;
    else
      cout << -1 << endl;
  }
  return 0;
}

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

int main() {
  for(int N; cin >> N && N;) {
    vector<vector<int> > G(N, vector<int>(N));
    for(int i = 0; i < N; ++i) {
      int M; cin >> M;
      while(M--) {
        int p; cin >> p;
        --p;
        G[i][p] = 1;
      }
    }
    int K; cin >> K;
    vector<int> A(N);
    while(K--) {
      int l; cin >> l;
      --l;
      A[l] = 1;
    }
    vector<int> res;
    for(int i = 0; i < N; ++i) {
      bool flag = true;
      for(int j = 0; j < N; ++j) {
        if(A[j] && !G[i][j]) {
          flag = false;
          break;
        }
      }
      if(flag) res.push_back(i);
    }
    if(res.size() == 1) {
      cout << res[0]+1 << endl;
    } else {
      cout << -1 << endl;
    }
  }
  return 0;
}

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

int main(){

cout<<yoshikawa<<endl;

return 0;
}