#include <iostream>
using namespace std;
int interpolationSearch(int arr[], int n, int x) {
int left = 0, right = n - 1;
while (left <= right && x >= arr[left] && x <= arr[right]) {
if (left == right) {
if (arr[left] == x) return left;
return -1;
}
int pos = left + ((x - arr[left]) * (right - left)) / (arr[right] - arr[left]);
if (arr[pos] == x) return 1;
if (arr[pos] < x) left = pos + 1;
else right = pos - 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 = interpolationSearch(a, n, target);
if(result==1) cout << "FOUND";
else cout << "NOT FOUND";
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgaW50ZXJwb2xhdGlvblNlYXJjaChpbnQgYXJyW10sIGludCBuLCBpbnQgeCkgewogICAgaW50IGxlZnQgPSAwLCByaWdodCA9IG4gLSAxOwoKICAgIHdoaWxlIChsZWZ0IDw9IHJpZ2h0ICYmIHggPj0gYXJyW2xlZnRdICYmIHggPD0gYXJyW3JpZ2h0XSkgewogICAgICAgIGlmIChsZWZ0ID09IHJpZ2h0KSB7CiAgICAgICAgICAgIGlmIChhcnJbbGVmdF0gPT0geCkgcmV0dXJuIGxlZnQ7CiAgICAgICAgICAgIHJldHVybiAtMTsKICAgICAgICB9CgogICAgICAgIGludCBwb3MgPSBsZWZ0ICsgKCh4IC0gYXJyW2xlZnRdKSAqIChyaWdodCAtIGxlZnQpKSAvIChhcnJbcmlnaHRdIC0gYXJyW2xlZnRdKTsKCiAgICAgICAgaWYgKGFycltwb3NdID09IHgpIHJldHVybiAxOwogICAgICAgIGlmIChhcnJbcG9zXSA8IHgpIGxlZnQgPSBwb3MgKyAxOwogICAgICAgIGVsc2UgcmlnaHQgPSBwb3MgLSAxOwogICAgfQogICAgcmV0dXJuIC0xOwp9CiAKaW50IG1haW4oKSB7CglpbnQgbix0YXJnZXQ7CgljaW4gPj4gbiA+PiB0YXJnZXQ7CglpbnQgYVtuXTsKCWZvcihpbnQgaSA9IDA7aTxuO2krKyl7CgkJY2luID4+IGFbaV07Cgl9CiAgIGludCByZXN1bHQgPSBpbnRlcnBvbGF0aW9uU2VhcmNoKGEsIG4sIHRhcmdldCk7CiAgIGlmKHJlc3VsdD09MSkgY291dCA8PCAiRk9VTkQiOwogICBlbHNlIGNvdXQgPDwgIk5PVCBGT1VORCI7CiAKICAgcmV0dXJuIDA7Cn0=