1
#include <bits/stdc++.h>
2
#define N 1000010
3
using namespace std;
4

5
struct Edge {
6
    int to, ne;
7
} edges[N << 1];
8
int h[N], idx = 0;
9
int dep[N];
10
int n, m, r;
11

12
void add(int u, int v) {
13
    idx++;
14
    edges[idx].to = v;
15
    edges[idx].ne = h[u];
16
    h[u] = idx;
17
}
18

19
void bfs() {
20
    queue<int> q;
21
    q.push(r);
22
    dep[r] = 0;
23
    while (!q.empty()) {
24
        int t = q.front();
25
        q.pop();
26

27
        for (int i = h[t]; ~i; i = edges[i].ne) {
28
            int j = edges[i].to;
29
            if (dep[j] > dep[t] + 1) {
30
                dep[j] = dep[t] + 1;
31
                q.push(j);
32
            }
33
        }
34
    }
35
}
36

37
int main() {
38
    ios::sync_with_stdio(false);
39
    cin.tie(nullptr);
40
    cout.tie(nullptr);
41

42
    memset(dep, 0x3f, sizeof dep);
43
    memset(h, -1, sizeof h);
44

45
    int q;
46
    cin >> n >> m >> r;
47
    while (m--) {
48
        int u, v;
49
        cin >> u >> v;
50
        add(u, v);
51
        add(v, u);
52
    }
53
    bfs();
54
    cin >> q;
55
    cout << "I'm here!" << endl;
56
    while (q--) {
57
        int a, b;
58
        cin >> a >> b;
59
        cout << (dep[a] <= dep[b] ? "Terry" : "Jom") << '\n';
60
    }
61
    return 0;
62
}