#include <iostream>

using namespace std;

int val,n,i,x[101],ls,ld,ok,m,poz;
int main()
    {cin>>n>>val;
    for (i=1;i<=n;i++)
        {
          cin>>x[i];
        }
    ls=1;ld=n;ok=0;
    while (ls<=ld && ok==0)
        {m=(ls+ld)/2;
            if (val==x[m])
            {poz=m;
             ok=1;
            }
            else if (val>x[m]) ls=m+1;
                     else ld=m-1;
        }
if (ok==1) cout<<poz;
    else cout<<"NU EXISTA";
        return 0;
    }