\problemname{Garbage In, Garbage Out}

\illustration{0.35}{garbage.png}{
    Similarly, in five hundred years,
    this is what artificially generated images will look like.
}

% optionally define variables/limits for this problem
\newcommand{\maxlen}{3\cdot10^5}
\newcommand{\maxwords}{5000}
\newcommand{\minwordlen}{6}
\newcommand{\maxwordlen}{10}
\newcommand{\maxtests}{100}

It is the 25th of July, 2525.
Now that the usage of Large Language Models (LLMs) is so ubiquitous,
it has become nearly impossible to find actual human-made articles on the internet and not get lost in all the gibberish produced by LLMs.

(Un)fortunately, LLM technology has regressed significantly.
Neural networks have been trained on data that is mostly generated by older LLMs, which in turn were trained on even older recycled data.
As a result, the output produced by most LLMs is a long string of lowercase letters, each chosen uniformly at random and independently of the others.

You decided to make a program to scavenge the internet in search of human-made articles.
Your program must determine whether a given text is human-made or generated by an LLM.

A given text is guaranteed to be exactly one of the following:
\begin{itemize}
    \item \emph{Human-made}, in which case it is a fixed concatenation (without spaces) of words from a given word list.
    \item \emph{Not human-made} and, therefore, generated by an LLM, in which case each character is chosen independently and uniformly at random.
\end{itemize}

\begin{Input}
    The input consists of:
    \begin{itemize}
        \item One line with a string $s$, the given text to check.
        \item One line with an integer $n$, the number of words in the word list.
        \item $n$ lines, each with a string $w$ ($\minwordlen \leq |w| \leq \maxwordlen$), the words in the word list.
            The words in the word list are distinct and fixed per test case.
    \end{itemize}
    All input strings only consist of English lowercase letters (\texttt{a-z}).

    Your submission will be run on exactly $100$ test cases, all of which will have $|s| = \maxlen$ and $n = \maxwords$.
    The samples are smaller and for illustration only.

    For each test case where $s$ is human-made, $s$ is fixed and does not change between each of your submissions.
    For each test case where $s$ is generated by an LLM,
    each of your submissions will receive a new string $s$,
    generated from independently and uniformly picking random English lowercase letters (\texttt{a-z}).
\end{Input}

\begin{Output}
    If the given string was human-made, output ``\texttt{yes}''.
    Otherwise, if it was generated by an LLM, output ``\texttt{no}''.
\end{Output}
