#include <iostream>
#include <vector>
#include <queue>
#include <climits>
#include <set>
#include <string>

using namespace std;
using ll = long long;

bool dfs(vector<vector<ll>> const& szomszedsagi_lista, ll point, ll end_point, vector<bool> &visited) {
	if (point == end_point) {
		return true;
	}
	visited[point] = true;

	for (ll szomszed : szomszedsagi_lista[point]) {
		if (!visited[szomszed]) {
			if (dfs(szomszedsagi_lista, szomszed, end_point, visited)) {
				return true;
			}
		}
	}
	return false;
}

int main() {
	ll numOfStatements, numOfLessons;
	cin >> numOfStatements >> numOfLessons;


	// Kezelj�k gr�f k�nt a megtanu�t �ll�t�sokat.
	vector<pair<ll, ll>> edges;
	vector<pair<ll, ll>> tests;

	ll typeOfLesson, from, to;
	vector<vector<ll>> adj(numOfStatements);

	vector<string> ans;
	for (int i = 0; i < numOfLessons; i++) {
		cin >> typeOfLesson >> from >> to;
		from--;to--;//index kompenzáció
		if (typeOfLesson == 1) {
			edges.push_back({ from, to });
			adj[from].push_back(to);
		}
		else {
			vector<bool> vis(numOfStatements, false);
			if (dfs(adj, from, to, vis)) {
				ans.push_back("IGEN");
			}
			else {
				ans.push_back("NEM");
			}
		}
	}
	for (string a : ans) {
		cout << a << "\n";
	}
}