Multithreaded Program

Maurice is debugging a multithreaded program on his old machine. The program has several threads operating on a set of shared variables. Each thread executes its own sequence of assignments in a predefined program order. Each assignment sets one variable to an integer value.

When the program runs, assignments from different threads can execute in any order. The only guarantee is that each thread executes all of its assignments in program order.

For example, suppose the program has three threads with $2$, $2$, and $1$ assignments in their sequences. One valid execution is:

• thread $1$ executes the first assignment in its sequence;
• thread $2$ executes the first assignment in its sequence;
• thread $2$ executes the second assignment in its sequence;
• thread $1$ executes the second assignment in its sequence;
• thread $3$ executes the only assignment in its sequence.

This execution can be described as $1, 2, 2, 1, 3$, where the numbers give the thread that performs each assignment, in order. Many other valid executions are also possible.

Maurice suspects that his machine is broken and may work incorrectly. He ran the program and recorded the values of all variables at the end.

Find an execution that performs all assignments and leads to the recorded values of all variables, or report that the machine is broken and no such execution exists.

The first line contains a single integer $t$, the number of threads ($1 \leq t \leq 100$). The threads are numbered from $1$ to $t$. The following lines describe $t$ sequences of assignments, one per thread.

The first line of the $i$-th description contains an integer $l_i$, the length of the sequence of assignments of the $i$-th thread ($1 \leq l_i \leq 100$). Each of the following $l_i$ lines contains an assignment in the form <variable>=<value>. The assignments are listed in program order. Variable names consist of up to $10$ lowercase English letters, and values are positive integers not exceeding $10^9$.

The first of the remaining lines contains an integer $k$, the number of variables ($1 \le k \le 10\,000$). Each of the following $k$ lines contains a variable name and its recorded value, which is a positive integer not exceeding $10^9$. Each variable used in the program is listed exactly once, and each listed variable is used in at least one assignment.

Print Yes if an execution producing the recorded values exists, and No otherwise.

If an execution exists, print a line containing $s = l_1 + l_2 + \dotsb + l_t$ integers $c_1, c_2, \ldots, c_s$, describing such an execution ($1 \le c_i \le t$). This specifies that the first assignment is performed by thread $c_1$, the second one by thread $c_2$, and so on. Each thread performs its assignments in program order. After the $s$-th assignment, each variable must have the recorded value. The $i$-th thread must appear in the description exactly $l_i$ times.