#include <iostream>
#include <cstdint>
#include <algorithm>

#include <vector>
#include <set>
#include <map>
#include <queue>

using namespace std;

typedef int64_t ll;

// megneztem a megoldast
// eleg okos, meg kell hagyni

void solve() {

    ll n, q;
    cin >> n >> q;

    ll inf = INT64_MAX / 10;

    vector<vector<ll>> d(n+1, vector<ll>(n+1, inf));

    vector<pair<pair<ll,ll>,ll>> ask;
    for(ll qi = 1; qi <= q; qi++) {  
        ll type, from, to;
        cin >> type >> from >> to;
        if(type == 2) {
            ask.push_back({{from, to}, qi});
        }else{
            d[from][to] = min(d[from][to], qi);
        }
    }

    // floyd warshall
    for(ll k = 1; k <= n; k++) {
        for(ll i = 1; i <= n; i++) {
            for(ll j = 1; j <= n; j++) {

                //cerr << "\nk=" << k << "; i=" << i << "; j=" << j;
                //cerr << "\ndp[i][k]=" << d[i][k] << "; dp[k][j]=" << d[k][j];

                if(d[i][k] < inf && d[k][j] < inf) {

                    //cerr << "\nedges aren't inf";

                    d[i][j] = min(max(d[i][k], d[k][j]), d[i][j]);

                    
                }

            }
        }
    }

    /*
    for(ll i = 1; i <= n; i++) {
        for(ll j = 1; j <= n; j++) {
            cerr << "\nd[" << i << "][" << j << "]=" << d[i][j]; 
        }
    }
    */

    for(const auto & [route, time] : ask) {
        ll from = route.first;
        ll to = route.second;

        //cerr << "\n" << from << "," << to << ", t=" << time;

        if(d[from][to] < time) {
            cout << "IGEN\n";
        }else{
            cout << "NEM\n";
        }
    }

}

int main() {
    
    std::ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    
    solve();
    
    return 0;

}