from collections import deque

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

def possible_bfs(graph, start, end):
    if start == end:
        return True
    visited = {start}
    queue = deque([start])
    while queue:
        curr = queue.popleft()
        for nextNode in graph[curr]:
            if nextNode == end:
                return True
            if nextNode not in visited:
                visited.add(nextNode)
                queue.append(nextNode)

    return False

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