#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());

    bool ableToDetect = true;
    int ownIdx = 0, enemyIdx = 0;
    vector<pair<int, int>> unableToDetectPairs;

    while (ownIdx < n && enemyIdx < m) {
        if (ownRadar[ownIdx] >= enemyRadar[enemyIdx]) {
            unableToDetectPairs.push_back({ownIdx + 1, enemyIdx + 1});
            enemyIdx++;
        } else {
            ownIdx++;
        }
    }

    if (enemyIdx < m) {
        ableToDetect = false;
    }

    if (ableToDetect) {
        cout << "IGEN" << endl;
    } else {
        cout << "NEM" << endl;
        cout << unableToDetectPairs[0].first << " " << unableToDetectPairs[0].second << endl;
    }

    return 0;
}