DAGame

Woo-young and Hyeon-cheol bet on a set of Yeongcheol Burger Don Mari meals. Hyeon-cheol made the following game.

A DAG (directed graph without cycles) has $N$ nodes and $M$ edges. $K$ pieces each sit on one of the nodes. There is no limit on how many pieces can sit on a node. Each piece has a color, written as an integer from $1$ to $N$. At most two pieces have any given color. Young and Cheol take turns, starting with Young. On a turn, a player picks one piece and moves it along an outgoing edge of its node to the next node. If two pieces of the same color sit on the same node, they stack and move together from then on. Pieces of different colors never affect each other. Pieces may already be stacked before the game starts. A player who cannot make a move on their turn loses. Given the initial graph and pieces, output who wins if both players play optimally.

The first line contains the number of nodes $N$ ($2 \le N \le 500$) and the number of edges $M$ ($1 \le M \le 100\,000$).

Each of the next $M$ lines contains two distinct integers $p$ and $q$ ($1 \le p, q \le N$), meaning there is an edge from node $p$ to node $q$. The same edge may appear more than once.

The next line contains the number of pieces $K$. ($1 \le K \le 2 \cdot N$)

Each of the next $K$ lines contains two integers $v_i$ and $c_i$ ($1 \le i \le K$), meaning piece $i$ has color $c_i$ and sits on node $v_i$. ($1 \le v_i, c_i \le N$)

The given graph is guaranteed to be a DAG.

If Young wins, print Young. If Cheol wins, print Cheol.