Grammar

A formal grammar is a way of describing formal languages as $\Gamma = \langle \Sigma, N, S \in N, P \subset N^{+} \times (\Sigma \cup N)^{\*}\rangle$ where $\Sigma$ is called an аlphabet and its elements are called terminals, $N$ is a set of nonterminals, $S$ is the starting nonterminal, and $P$ is a set of production rules of the form $\alpha \rightarrow \beta$.

Here, $N^{+}$ contains all strings of one or more elements of $N$ (non-empty strings of nonterminals), and $(\Sigma\cup N)^{\*}$ consists of all strings of zero, one or more elements of $(\Sigma\cup N)$ (strings of terminals and nonterminals, including the empty string).

A grammar is called context-free if the left side of each production rule consists of exactly one nonterminal, more formally, $P \subset N \times (\Sigma\cup N)^{\*}$.

For example, let us consider a grammar from the second example test case with alphabet $\Sigma = \\{`a`, `b`\\}$, set of nonterminals $N = \\{S, A\\}$ and two production rules:

1. $S \rightarrow `b`A$
2. $A \rightarrow `aa`$

One can easily see that it is a context-free grammar.

To create the language generated by a grammar, one needs to start from a string consisting of only start nonterminal $S$, and then apply production rules one or more times. Applying a production rule is the procedure of finding the left side of that rule somewhere in the current string and replacing it by the string from the right side of that rule. The language generated by $\Gamma$ is the set of all strings consisting only of terminals that can be produced by applying production rules one or more times.

For example, there is a string $`baa`$ in the language generated by the grammar described above. To produce it, one could apply productions $S \rightarrow `b`A \rightarrow `baa`$. There are no other strings in the language generated by this grammar.

Some grammars may even generate infinite languages, others may generate empty ones.

You are given a context-free grammar with an alphabet consisting of two terminals "a" and "b". Your task is to check whether the language generated by this grammar contains a string consisting of strictly more characters "a" than characters "b".

Nonterminals in this task are enumerated from $1$ to $n$. The starting nonterminal always has number $1$.

The input consists of one or more test cases.

The first line of each test case contains two integers $n$ and $m$: the number of nonterminals and the number of production rules ($1 \le n \le 100$, $1 \le m \le 50,000$).

Each of the next $m$ lines describes one production rule in the following manner. At first, $A\_i$ and $k\_i$ are given: the number of left side nonterminal ($1 \le A\_i \le n$) and the number of characters on the right side of the production rule ($0 \le k\_i \le 100$). Then $k\_i$ objects follow, each of them is either a nonterminal $B\_{i,j}$ ($1 \le B\_{i,j} \le n$) or a terminal "a" or "b". Consecutive characters are separated by single spaces.

The total sum of all $n$ over all test cases does not exceed $1000$. The total sum of all $m$ over all test cases does not exceed $50\\,000$. The size of the input does not exceed $5$ megabytes.

The input is terminated by a string of two zeroes.

For each test case, output a separate line. It must contain "YES" if the language generated by the given grammar contains a string consisting of strictly more characters "a" than characters "b", otherwise the line must contain "NO".