#include <iostream>
#include <vector>
#include <queue>
using namespace std;

void slove()
{
	ios_base::sync_with_stdio(0);
	cin.tie();
	cout.tie();

	int n, q;
	int t, a, b;
	cin >> n >> q;
	vector<vector<int>> tomb(n + 1, vector<int>(n + 1, 0));
	for (int i = 0; i < q;++i)
	{
		cin >> t >> a >> b;
		if (t == 1)
		{
			tomb[a][b] = 1;
		}
		else
		{
			bool nincs=1;
			vector<int> jel(n+1,0);
			queue<int> sor;
			sor.push(a);
			jel[a] = 1;
			while (!sor.empty() and nincs)
			{
				int x = sor.front();
				for (int i = 1;i <= n;++i)
				{
					if (tomb[x][i] == 1 and jel[i] == 0)
					{
						sor.push(i);
						jel[i] = 1;
						if (i == b)
						{
							nincs = 0;
							break;
						}
					}
				}
				sor.pop();
			}
			if (nincs) cout << "NEM\n";
			else cout << "IGEN\n";
		}
	}
	/*cout << "  ";
	for (int j = 0;j <= n;++j)
	{
		if (j > 0) cout << j << " ";
		for (int i = 1;i <= n;++i)
		{
			if (j == 0 and i > 0) cout << i << " ";
			else cout << tomb[j][i] << " ";
		}
		cout << endl;
	}*/
}
int main()
{
	slove();
	return 0;
}