#include <iostream>
#include <array>
using namespace std;
 
int linearSearch(int arr[], int target, int n) 
{
    for( int i = 0; i < n; i++ ) {
        if ( arr[i] == target) {
            return 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 res = linearSearch(a, target, n);    
   if(res==1) cout << "FOUND";
   else cout << "NOT FOUND";
    return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YXJyYXk+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbGluZWFyU2VhcmNoKGludCBhcnJbXSwgaW50IHRhcmdldCwgaW50IG4pIAp7CiAgICBmb3IoIGludCBpID0gMDsgaSA8IG47IGkrKyApIHsKICAgICAgICBpZiAoIGFycltpXSA9PSB0YXJnZXQpIHsKICAgICAgICAgICAgcmV0dXJuIDE7CiAgICAgICAgfQogICAgfQogICAgcmV0dXJuIC0xOwp9CgppbnQgbWFpbigpIAp7CglpbnQgbix0YXJnZXQ7CgljaW4gPj4gbiA+PiB0YXJnZXQ7CglpbnQgYVtuXTsKCWZvcihpbnQgaSA9IDA7aTxuO2krKyl7CgkJY2luID4+IGFbaV07Cgl9CgkKICAgIGludCByZXMgPSBsaW5lYXJTZWFyY2goYSwgdGFyZ2V0LCBuKTsgICAgCiAgIGlmKHJlcz09MSkgY291dCA8PCAiRk9VTkQiOwogICBlbHNlIGNvdXQgPDwgIk5PVCBGT1VORCI7CiAgICByZXR1cm4gMDsKfQ==

NiAzNgoxMiAzMDQ5IDUzOTQgMTIzIDM2IC01

6 36
12 3049 5394 123 36 -5