Electronic devices

Jongbeom has $N$ electronic devices at home. Device $i$ is made of $X_i$ components, and component $j$ of device $i$ works only when it receives exactly $A_{i,j}$ units of power. With less than $A_{i,j}$ it does not have enough power to run, and with more than $A_{i,j}$ it burns out. Device $i$ can be used when at least $Y_i$ of its components work.

Jongbeom has $M$ power supplies. Power supply $k$ picks one of $Z_k$ distinct power values and feeds it to exactly one component. The $l$-th smallest power that supply $k$ can deliver is $B_{k,l}$.

Until the move, Jongbeom used all $N$ devices without trouble. He pulled out every cable without writing down which supply had been connected to which component, so nothing works in the new place. Find a set of connections that makes all $N$ devices usable again.

The first line contains $N$. ($1 \le N \le 100$)

Lines 2 through $2N + 1$ describe the $N$ devices.

• Line $2i$ contains $X_i$ and $Y_i$. ($1 \le Y_i \le X_i \le 100$)
• Line $2i + 1$ contains the integers $A_{i,1}, A_{i,2}, \dots, A_{i,X_i}$. ($1 \le A_{i,j} \le 10^9$)

Line $2N + 2$ contains $M$. ($1 \le M \le 10000$)

Lines $2N + 3$ through $2N + 2M + 2$ describe the $M$ power supplies.

• Line $2N + 2k + 1$ contains $Z_k$. ($1 \le Z_k \le 10$)
• Line $2N + 2k + 2$ contains the integers $B_{k,1} < B_{k,2} < \dots < B_{k,Z_k}$ in increasing order. ($1 \le B_{k,l} \le 10^9$)

At least one set of connections that makes all $N$ devices usable is guaranteed to exist.

Connect exactly $Y_i$ components on device $i$, so the number of connections $W$ equals $Y_1 + Y_2 + \dots + Y_N$.

Print $W$ on the first line. Each of the next $W$ lines holds one connection as four integers $i$, $j$, $k$, $l$. It means that power supply $k$ is connected to component $j$ of device $i$, and that the supply delivers the $l$-th smallest power it can produce.

A component may appear at most once, and a power supply may appear at most once. The power a connected component needs must equal the power its supply delivers.

Print the $W$ lines sorted by comparing the four integers in the order $i$, $j$, $k$, $l$. If several answers satisfy the rules, print the one whose sequence $i_1, j_1, k_1, l_1, i_2, j_2, \dots$ of all $4W$ integers, read from the top line down, is lexicographically smallest.

The answer to the first example has 5 connections.

Device 1 takes power 4 on component 1 from supply 2, and power 3 on component 3 from supply 1. Two components work, which meets $Y_1 = 2$, so device 1 can be used.

Device 2 takes power 4 on component 2 from supply 3, power 1 on component 3 from supply 5, and power 4 on component 4 from supply 4. Three components work, so device 2 can be used as well.

Component 1 of device 2 needs power 2, and supply 2 is the only one that can deliver power 2. In the lexicographically smallest answer, component 1 of device 1 takes supply 2, so device 2 connects its other three components.