Description

You are given a text $T$ and a pattern $P$. You want to check if you can erase some of the letters of $T$ so that the remaining symbols produce exactly $P$. For example, the word programming can be partially erased to obtain pong or program or roaming (but not map, as the letters must remain in the same order). Both words consist of small letters of the English alphabet only.

There is just one catch: the text $T$ is encoded by a system of equations. The equations use special symbols (every symbol is denoted by a word in capital letters), each of them encoding some word over the alphabet a,...,z. Each equation is of one of the following forms:

• $\operatorname{A}$ = a word over a,...,z

• $\operatorname{A}=\operatorname{B}+\operatorname{C}$

where $\operatorname{A}$, $\operatorname{B}$, $\operatorname{C}$ can be any special symbols, and the + sign denotes the concatenation of words. The system is:

• unambiguous – for a fixed symbol $\operatorname{A}$, there is exactly one equation with $\operatorname{A}$ on the left-hand side, and

• acyclic – if you start from any symbol $\operatorname{A}$ and make substitutions according to the equations (right-hand side for left-hand side), you can never obtain an expression containing $\operatorname{A}$ again.

Such a system always has a unique solution. For example, in the system:

• $\operatorname{START}=\operatorname{FIRST}+\operatorname{SECND}$

• $\operatorname{FIRST}=\operatorname{D}+\operatorname{E}$

• $\operatorname{SECND}=\operatorname{F}+\operatorname{E}$

• $\operatorname{D}=$good

• $\operatorname{E}=$times

• $\operatorname{F}=$bad

the symbol $\operatorname{START}$ encodes the word goodtimesbadtimes.

Given a single word $P$ as the pattern, a system of equations, and one particular starting symbol $S$ of this system, determine whether the pattern $P$ is present in the word encoded by $S$.

Input Format

The first line of the input contains the number of test cases $T$. The descriptions of the test cases follow:

Each test case starts with a line containing a single integer $k$ ($1\le k\le 500$)—the number of equations. The next $k$ lines contain equations. Each of them has one of the two forms given in the problem statement, with spaces separating words, plus signs, and equation signs. Each word (including symbol names) is at least one and at most five characters long.

The next line contains a single special symbol (a word in capital letters), while the final line contains a non-empty word of at most $2000$ lowercase letters. These are the starting symbol and the pattern to find, respectively.

Output Format

Print the answers to the test cases in the order in which they appear in the input. For each test case print the answer in a separate line: YES if the pattern appears in the given encoded word, and NO otherwise.

1
6
START = FIRST + SECND
FIRST = D + E
SECND = F + E
D = good
E = times
F = bad
START
debate

YES