from collections import deque

n, q = map(int, input().split())
adj = [set() for _ in range(n)]


def possible_bfs(graph, start, end):
    if start == end:
        return True

    visited = [False] * n
    visited[start] = True
    queue = deque([start])

    while queue:
        curr = queue.popleft()
        for next_node in graph[curr]:
            if next_node == end:
                return True
            if not visited[next_node]:
                visited[next_node] = True
                queue.append(next_node)

    return False


for _ in range(q):
    t, x, y = map(int, input().split())
    x -= 1
    y -= 1
    if t == 1:
        adj[x].add(y)
    else:
        print("IGEN" if possible_bfs(adj, x, y) else "NEM")