#include <iostream>
using namespace std;
int binarySearch(int arr[], int n, int x) {
int left = 0, right = n - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == x)
return 1;
if (arr[mid] < x)
left = mid + 1;
else
right = mid - 1;
}
return -1;
}
int main() {
int n,target;
cin >> n >> target;
int a[n];
for(int i = 0;i<n;i++){
cin >> a[i];
}
int result = binarySearch(a, n, target);
if(result==1) cout << "FOUND";
else cout << "NOT FOUND";
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGJpbmFyeVNlYXJjaChpbnQgYXJyW10sIGludCBuLCBpbnQgeCkgewogICAgaW50IGxlZnQgPSAwLCByaWdodCA9IG4gLSAxOwogICAgCiAgICB3aGlsZSAobGVmdCA8PSByaWdodCkgewogICAgICAgIGludCBtaWQgPSBsZWZ0ICsgKHJpZ2h0IC0gbGVmdCkgLyAyOwogICAgICAgIAogICAgICAgIGlmIChhcnJbbWlkXSA9PSB4KQogICAgICAgICAgICByZXR1cm4gMTsgCiAgICAgICAgCiAgICAgICAgaWYgKGFyclttaWRdIDwgeCkKICAgICAgICAgICAgbGVmdCA9IG1pZCArIDE7IAogICAgICAgIGVsc2UKICAgICAgICAgICAgcmlnaHQgPSBtaWQgLSAxOyAKICAgIH0KICAgIAogICAgcmV0dXJuIC0xOyAKfQoKaW50IG1haW4oKSB7CglpbnQgbix0YXJnZXQ7CgljaW4gPj4gbiA+PiB0YXJnZXQ7CglpbnQgYVtuXTsKCWZvcihpbnQgaSA9IDA7aTxuO2krKyl7CgkJY2luID4+IGFbaV07Cgl9CiAgIGludCByZXN1bHQgPSBiaW5hcnlTZWFyY2goYSwgbiwgdGFyZ2V0KTsKICAgaWYocmVzdWx0PT0xKSBjb3V0IDw8ICJGT1VORCI7CiAgIGVsc2UgY291dCA8PCAiTk9UIEZPVU5EIjsKCSAgICAKICAgcmV0dXJuIDA7Cn0KCg==