Hot Potato Routing

The hot potato principle is a packet routing method for networks. Its main advantages are that it needs no routing tables and no packet analysis during routing.

The network has $n$ nodes, and some pairs of nodes are connected by network links. Each node has a schedule. The schedule of node $i$ is a sequence of node numbers $a_{i,0}, a_{i,1}, \ldots, a_{i, l_i - 1}$. The network works in ticks as follows.

During tick $t$, several packets may be in the network. Each packet has a source node and a destination node, and during a tick it is located at some node. Each packet has an appearance time. At the start of that tick, it appears at its source node. If during tick $t$ a packet is at its destination node, it is delivered at moment $t$ and removed from the network. Otherwise it is forwarded to node $a_{i, t \bmod l_i}$, where it arrives at the start of the next tick. If several packets arrive at the same node at the start of a tick, all of them are destroyed.

The main drawback of this routing principle follows from its main advantages. Without routing tables and packet analysis, the node schedules and packet appearance times must be chosen very carefully so that all packets are delivered. Even with a good choice, often not all packets can be delivered.

You are given the network description and a set of packets. For each packet you may decide whether to try to deliver it. Choose the maximum number of packets such that all of them are delivered during the operation of the network.

The first line contains $n$, the number of nodes ($1 \le n \le 100$). The next $n$ lines describe the nodes. The $i$-th node is described by its schedule length $l_i$, followed by $l_i$ numbers $a_{i,0}, a_{i,1}, \ldots, a_{i,l_i-1}$ ($1 \le l_i \le 8$, $a_{i,j} \ne i$).

The next line contains $p$, the number of packets ($1 \le p \le 100$). Then follow $p$ lines, each describing one packet by its source node $s_i$, destination node $d_i$, and appearance time $t_i$ ($s_i \ne d_i$, $0 \le t_i \le 1000$).

The first line contains $k$, the maximum number of packets that can be delivered. The second line contains the $k$ numbers of the packets that can be delivered. Packets are numbered from 1 to $p$ in the order given in the input.