#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n,m;
    cin>>n>>m;
    int a[n];
    int b[m];
    f(i,0,n)    cin>>a[i];
    f(i,0,m)    cin>>b[i];

    if(*min_element(a,a+n)>*max_element(b,b+m)) cout<<"IGEN\n";
    else
    {
        cout<<"NEM\n";
        cout<<distance(a,min_element(a,a+n))+1<<"\n"<<distance(b,max_element(b,b+m))+1<<"\n";
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}