#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;

    vector<int> ownRadar(n);
    vector<int> enemyRadar(m);

    for (int i = 0; i < n; i++) {
        cin >> ownRadar[i];
    }

    for (int i = 0; i < m; i++) {
        cin >> enemyRadar[i];
    }

    sort(ownRadar.begin(), ownRadar.end());

    for (int i = 0; i < m; i++) {
        int enemy = enemyRadar[i];
        auto it = upper_bound(ownRadar.begin(), ownRadar.end(), enemy);
        if (it == ownRadar.end()) {
            cout << "NEM" << endl;
            cout << enemy << endl;
            return 0;
        }
    }

    cout << "IGEN" << endl;

    return 0;
}