1798B.go

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

var in, out = bufio.NewReader(os.Stdin), bufio.NewWriter(os.Stdout)

func _readInt() int {
	var x int
	fmt.Fscan(in, &x)
	return x
}
func _readStr() string {
	var x string
	fmt.Fscan(in, &x)
	return x
}
func _readArr(x ...int) (int, []int) {
	var n int
	if len(x) == 0 {
		fmt.Fscan(in, &n)
	} else {
		n = x[0]
	}
	var v = make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(in, &v[i])
	}
	return n, v
}
func _print(x ...any) {
	fmt.Fprintln(out, x...)
}
func _printIntArr(x []int) {
	for _, v := range x {
		fmt.Fprint(out, v, " ")
	}
	fmt.Fprintln(out)
}
func _printStrArr(x []string) {
	for _, v := range x {
		fmt.Fprint(out, v, " ")
	}
	fmt.Fprintln(out)
}
func _yes() {
	fmt.Println("YES")
}
func _no() {
	fmt.Println("NO")
}
func _max(x ...int) int {
	mi := 0
	for i := 1; i < len(x); i++ {
		if x[i] > x[mi] {
			mi = i
		}
	}
	return x[mi]
}
func _min(x ...int) int {
	mi := 0
	for i := 1; i < len(x); i++ {
		if x[i] < x[mi] {
			mi = i
		}
	}
	return x[mi]
}
func _sum(x ...int) int {
	res := 0
	for _, i := range x {
		res += i
	}
	return res
}
func _abs(x int) int {
	if x < 0 {
		return -x
	}
	return x
}
func _sortStr(x string) string {
	r := []rune(x)
	sort.Slice(r, func(i, j int) bool {
		return r[i] < r[j]
	})
	return string(r)
}
func _reverseInts(x []int) {
	n := len(x)
	for i := 0; i < n/2; i++ {
		x[i], x[n-1-i] = x[n-1-i], x[i]
	}
}
func _reverseStr(s string) string {
	x := []rune(s)
	n := len(x)
	for i := 0; i < n/2; i++ {
		x[i], x[n-1-i] = x[n-1-i], x[i]
	}
	return string(x)
}
func _makeMatrix(n, m int) [][]int {
	x := make([][]int, n)
	for i := range x {
		x[i] = make([]int, m)
	}
	return x
}

func main() {
	var t int
	for fmt.Fscanln(in, &t); t > 0; t-- {
		solve()
	}
	out.Flush()
}

// source: https://codeforces.com/contest/1798/problem/B
func solve() {
	m := _readInt()
	d := make([][]int, m)
	for i := range d {
		n := _readInt()
		_, d[i] = _readArr(n)
	}

	ans := make([]int, m)
	users := make(map[int]bool)
	for i := m - 1; i >= 0; i-- {
		winner := -1
		for j := range d[i] {
			if !users[d[i][j]] {
				winner = d[i][j]
				break
			}
		}

		if winner == -1 {
			_print(-1)
			return
		}

		ans[i] = winner
		for j := range d[i] {
			users[d[i][j]] = true
		}
	}

	_printIntArr(ans)
}