Description

Terry and Jom are playing a game on an undirected connected graph with $n$ nodes and $m$ edges, which has a designated "root" node $r$. The game follows these rules:

• Terry moves first.
• The two players take turns moving along the edges of the graph, with each move traversing one edge (or they can choose to "rest" and do nothing).
• Terry cannot move to the node where Jom is currently located (Terry is only considered "caught" if he voluntarily moves to the same node as Jom; it is allowed for both to move to the same node $u$ within the same turn, as long as Terry goes there first).

Given $q$ queries, each specifying the starting positions $a$ and $b$ of Terry and Jom respectively, determine whether Terry can reach the root node $r$.

Input Format

The first line contains three integers $n$, $m$, and $r$, representing the number of nodes, the number of edges, and the index of the root, respectively.

The next $m$ lines each contain two integers $(u, v)$, representing an edge between nodes $u$ and $v$ (Note that there may contain multiple edges and self-loops).

The following line contains a single integer $q$, representing the number of queries.

The next $q$ lines each contain two integers $a$ and $b$, representing the starting positions of Terry and Jom, respectively.

Output Format

Since this is a warm-up problem, you should print I'm here! at the beginning.

For the $i$-th line of the next $q$ lines, print Terry if Terry can reach the root in the $i$-th query; otherwise, print Jom.

5 4 3
4 3
3 2
1 5
1 2
2
1 2
5 4

I'm here!
Jom
Jom

5 5 4
1 4
4 3
3 2
4 5
5 3
2
3 1
5 1

I'm here!
Terry
Terry

Hint

Subtasks and Constraints

• Special Property A: $q = 0$.
• Special Property B: The graph is a chain.
• Special Property C: The graph is a star graph.

For all tests, it is guaranteed that:

• $1 \le n, m \le 10^6$;
• $0 \le q \le 10^6$;
• $1 \le r, u, v, a, b \le n$;
• The given graph is an undirected connected graph.