Pick Your Own Nim

Alice and Bob love playing Nim. If the heaps are $a_1, \ldots, a_n$, the first player wins if and only if $a_1 \oplus \cdots \oplus a_n$ is nonzero. Some online games let players pick their characters before the match, so they made a new version. Each of them has several boxes of heaps. In the first phase, each player picks exactly one heap from each of their boxes. In the second phase, Alice chooses a nonempty subset of the heaps she picked, and regular Nim starts on the chosen heaps with Bob to move first. Bob already knows which heaps Alice picked. Help him choose his heaps so that he wins no matter which subset Alice chooses.

The first line contains the number of heaps $n$ picked by Alice ($0 \le n \le 60$). If $n > 0$, the next line contains the $n$ heap sizes. If $n = 0$, that line is omitted. The next line contains the number of Bob's boxes $m$ ($1 \le m \le 60$). Each of the next $m$ lines describes one box. It starts with $k_i$ ($1 \le k_i \le 5000$), the number of heaps in the box, followed by the $k_i$ heap sizes. Each heap size is between $1$ and $2^{60}-1$, inclusive. The total number of heaps in Bob's boxes is at most 5000.

If Bob cannot win, meaning that no matter which heaps he picks, Alice can choose a subset that leaves the resulting Nim position losing, print $-1$. Otherwise, print $m$ integers: the sizes of the heaps Bob should pick from his boxes, in the same order as the boxes are given in the input.

In Nim, several heaps of stones are on the table. On each turn, a player selects any heap and takes a positive number of stones from it. The player who takes the last stone wins.