#include <iostream>
#include <vector>

using namespace std;

int n,q;
long long inf=INT32_MAX-1;
struct kerdes
{
int time,from,to;

}typedef kerdes;

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>q;
    vector<vector<int>> graph(n+1,vector<int> (n+1,inf));
    int x,y,z;
    vector<kerdes> kerdesek;
    for(int i=0;i<q;i++)
        {
        cin>>z>>x>>y;
        if(z==1)
            {
            graph[x][y]=min(graph[x][y],i);
            }
        else
            {
            kerdes a;
            a.time=i;
            a.from=x;
            a.to=y;
            kerdesek.push_back(a);
            }
        }
    for(int k=1;k<=n;k++)
        {
        for(int i=1;i<=n;i++)
            {
            for(int j=1;j<=n;j++)
                {
                if(graph[k][j]!=inf && graph[i][k]!=inf)
                    {
                    graph[i][j]=min(graph[i][j],max(graph[i][k],graph[k][j]));
                    }
                }
            }
        }
    for(auto x : kerdesek)
        {
        if(graph[x.from][x.to]<x.time)
            {
            //cout<<graph[x.from][x.to]<<" ";
            cout<<"IGEN\n";
            }
        else
            {
            cout<<"NEM\n";
            }
        }
    return 0;
}