32484번 - Headline Heat 다국어

문제

The German ICPC scene is widely considered one of the most competitive. At least, that's what we tell our students. Countless rivalries form a complex web of envy, despair, glory, and triumph woven around and manifested in the unrelenting echoes of two scoreboards -- Winter Contest and GCPC. While generations of participants tend to forget the grudges of their predecessors, we coaches, acting as timeless beacons of continuity, preserve these petty conflicts between long forgotten teams. Striving for perfect balance, we express our dedication to our coaching duties in a furious outcry on social media against every unfair news article. That is, a coach gets mad if a news article is published that contains a rival university name more often than their own.

To smoothen the waves of conflict in this ocean of rage, a newly appointed authority is tasked with proofreading media coverage of GCPC and Winter Contest to prevent uneven coverage.

입력

The input consists of:

• One line with the number of universities $n,ドル rivalries $m,ドル and articles $k$. (1ドル\leq n,m,k\leq 10^5$)
• $n$ lines containing the name of a university $p_i$.
• $m$ lines containing two integers $u,v,ドル meaning that universities $u$ and $v$ are rivals. (1ドル\leq u,v \leq n, u\neq v$)
• $k$ lines containing a news article $t_i$.

If a university $u$ is a rival of university $v,ドル then $v$ is also a rival of $u$. Moreover, there are no duplicate rivalries.

Names and articles are strings of lowercase Latin letters and spaces. The first and last character of a name or article are never a space. Names can overlap and be contained in other names.

The summed length of all names and articles is at most 10ドル^6,ドル i.e. $\sum_{i=1}^{n} |p_i| + \sum_{i=1}^{k} |t_i| \leq 10^6$.

출력

For each article, output "no" if it will draw the wrath of at least one coach and "yes" otherwise.

제한

힌트